[Programmers] Lv2: 구명보트(42885)

문제

- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/42885?language=java

 

풀이

import java.util.*;

class Solution {
    public int solution(int[] people, int limit) {
        int answer = 0;
        
        Arrays.sort(people);
        
        int i = 0;
        int j = people.length - 1;
        
        while (i <= j) {
            if (people[j] + people[i] <= limit) {
                i += 1;
                j -= 1;
            } else {
                j -= 1;
            }
            
            answer += 1;
        }
        
        return answer;
    }
}