[PGS[구명보트

lifeboat.java

@@ -0,0 +1,29 @@
+import java.util.*;
+class Solution {
+    public int solution(int[] people, int limit) {
+        Arrays.sort(people);
+        Deque<Integer> p_list = new ArrayDeque<>();
+        for(int p : people){
+            p_list.add(p);
+        }
+        int count = 0;
+        while(!p_list.isEmpty()){
+            if(p_list.size()==1){
+                p_list.pollFirst();
+                count++;
+                break;
+            }
+            int small = p_list.peekFirst();
+            int big = p_list.peekLast();
+            if(small+ big > limit){
+                p_list.pollLast();
+            }else{
+                p_list.pollFirst();
+                p_list.pollLast();
+            }
+            count++;
+        }
+
+        return count;
+    }
+}