[Programmers] 42586. 기능개발

import java.util.*;

class Solution {
    public int[] solution(int[] progresses, int[] speeds) {
        Queue<Integer> q = new LinkedList<>();
        List<Integer> answerList = new ArrayList<>();
        
        for(int i = 0; i < speeds.length; i++) {
            double remain = (100 - progresses[i]) / (double) speeds[i];
            int date = (int) Math.ceil(remain); //Math.ceil: 올림
            
            if(!q.isEmpty() && q.peek() < date) { //3 < 5
                answerList.add(q.size());
                q.clear();
            }
            q.offer(date);
        }
        
        answerList.add(q.size());
        
        int[] answer = new int[answerList.size()];
        
        for(int i = 0; i < answer.length; i++) {
            answer[i] = answerList.get(i);
        }
        
        return answer;
    }
}