[프로그래머스][JAVA] 구명보트 (그리디)

import java.util.*;
 
class Solution {
    public int solution(int[] people, int limit) {
        Arrays.sort(people);
        // System.out.println(people[0]);
        
        int answer = 0;
        int i = 0;
        int j = people.length-1;
        while(i<=j){
            if(i==j){
                answer++;
                break;
            }
            else{
                if(people[i]+people[j]<=limit){
                    i++;
                    j--;
                    answer++;
                }
                else{
                    j--;
                    answer++;
                }  
            }           
        }
        
        
        return answer;
    }
}