[programmers][X] 구명보트

https://school.programmers.co.kr/learn/courses/30/lessons/42885

문제좀 잘 보자..

import java.util.*;

class Solution {
    public int solution(int[] people, int limit) {
        int answer = 0;

        Arrays.sort(people);

        int right = people.length-1;
        int left = 0;

        while(left <= right){
            if(people[left] + people[right] <= limit){
                left++;
            }
            right--;
            answer++;
        }

        return answer;
    }
}


© 2023 Lee. All rights reserved.