[level 2] Title: 기능개발, Time: 0.29 ms, Memory: 76.5 MB -BaekjoonHub

Author: JWMin556

프로그래머스/2/42586. 기능개발/README.md

@@ -1,10 +1,10 @@
 # [level 2] 기능개발 - 42586 
 
-[문제 링크](https://school.programmers.co.kr/learn/courses/30/lessons/42586) 
+[문제 링크](https://school.programmers.co.kr/learn/courses/30/lessons/42586?language=java) 
 
 ### 성능 요약
 
-메모리: 85 MB, 시간: 2.96 ms
+메모리: 76.5 MB, 시간: 0.29 ms
 
 ### 구분
 
@@ -16,7 +16,7 @@
 
 ### 제출 일자
 
-2025년 05월 03일 11:19:08
+2025년 12월 13일 10:53:26
 
 ### 문제 설명
 

프로그래머스/2/42586. 기능개발/기능개발.java

@@ -1,40 +1,36 @@
-import java.util.ArrayDeque;
-import java.util.ArrayList;
-import java.util.List;
-import java.util.Queue;
+import java.util.*;
 
 class Solution {
+    private static int divide(int x, int y) {
+        return (x % y == 0) ? (x / y) : (x / y) + 1;
+    }
+    
     public int[] solution(int[] progresses, int[] speeds) {
         int[] answer = {};
-        Queue<Integer> queue = new ArrayDeque<>();  // 각 일별로 며칠 내에 끝낼 수 있는지 큐에 저장
-        List<Integer> finalList = new ArrayList<>();
-
+        List<Integer> answerList = new ArrayList<>();
+        Queue<Integer> queue = new ArrayDeque<>();
+        
         for (int i = 0; i < progresses.length; i++) {
-            int progress = progresses[i];
-            int speed = speeds[i];
-            int remainingTime = 0;
-            if ((100 - progress) % speed == 0) {
-                remainingTime = (100 - progress) / speed;
-            } else {
-                remainingTime = ((100 - progress) / speed) + 1;
-            }
-            queue.add(remainingTime);
+            int remainingProgresses = 100 - progresses[i];
+            int remainingValue = divide(remainingProgresses, speeds[i]);
+            queue.add(remainingValue);
         }
-
-        int theBiggestRemaining = queue.isEmpty() ? 0 : queue.poll();
-        int count = 1;
-        while (!queue.isEmpty()) {
+        
+        while(!queue.isEmpty()) {
             int current = queue.poll();
-            if (current > theBiggestRemaining) {
-                finalList.add(count);
-                theBiggestRemaining = current;
-                count = 1;
-            } else {
+            int count = 1;
+            
+            while (!queue.isEmpty() && queue.peek() <= current) {
+                queue.poll();
                 count++;
             }
+            answerList.add(count);
+        }
+        answer = new int[answerList.size()];
+        for (int i = 0; i < answerList.size(); i++) {
+            answer[i] = answerList.get(i);
         }
-        finalList.add(count);
-        answer = finalList.stream().mapToInt(i -> i).toArray();
+        
         return answer;
     }
 }