프로그래머스 level2 ) 기능개발

기능개발

예전에 못풀었던 문제 지금 보니까 아주 쉽게 품

import java.io.IOException;
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.Queue;
class Solution {
    public int[] solution(int[] progresses, int[] speeds) {
        int[] answer = {};
		int n=progresses.length;
		Queue<Integer> remain_time = new LinkedList<>();
		for(int i=0;i<n; i++)
		{
			remain_time.add((int)Math.ceil((100-progresses[i])/(double)speeds[i]));
		}
		int day=0;
		ArrayList<Integer> ans_list = new ArrayList<Integer>();
		while(!remain_time.isEmpty())
		{
			int func_num=0;
			while(!remain_time.isEmpty() && remain_time.peek()<=day)
			{
				remain_time.remove();
				func_num++;
			}
			if(func_num!=0)
				ans_list.add(func_num);
			day++;
		}
		answer = new int[ans_list.size()];
		for(int i=0;i<ans_list.size(); i++)
		{
			answer[i] = ans_list.get(i);
			System.out.print(answer[i]+" ");
		}

        return answer;
    }
}