[자바] 프로그래머스 - 기능개발

ArrayList<Integer> alist = new ArrayList<>();
        Queue<Integer> q = new LinkedList<>();
 
        for (int i = 0; i < progresses.length; i++) {
            q.add((100 - progresses[i]) % speeds[i] == 0 ? (100 - progresses[i]) / speeds[i]
                    : (100 - progresses[i]) / speeds[i] + 1
            );
        }
    
 
        int count = 1;
        int getval = q.poll();
        while (!q.isEmpty()) {
 
            int num = q.poll();
            if (getval >= num) {
                count++;
 
            } else {
                alist.add(count);
                count = 1;
                getval = num;
            }
            if(q.size() == 0)  alist.add(count);
 
        }
 
        int[] answer = new int[alist.size()];
        for (int i = 0; i < alist.size(); i++) {
 
            answer[i] = alist.get(i);
 
        }
        System.out.println(alist);
 
 
        return answer;

큐를 배웠으니 써먹어야 해서 써봤다.