프로그래머스-기능개발

https://programmers.co.kr/learn/courses/30/lessons/42586

코딩테스트 연습 - 기능개발

<내풀이>

package algorithm_2;

import java.util.ArrayList;

public class l11 {
	   public static int[] solution(int[] progresses, int[] speeds) {

	        ArrayList<Integer> list =new ArrayList<>();
	        int days=0;
	        for(int i =0; i<progresses.length;i++) {
	        	int count=1;
	        	if(i==progresses.length-1) {
	        		list.add(count);
	        		break;
	        	}
	        	
	        	days+=(Math.ceil((double)(100-progresses[i])/speeds[i]));
	        	for(int j = i+1;j<progresses.length;j++) {
	        		if(progresses[j]+speeds[j]*days>=100) {
	        			if(j==progresses.length-1) {
	        				count++;
	        				list.add(count);
	        				i=j;
	        			}else {
	        				count++;	
	        			}
	        			
	        		}else {
	        			progresses[j]=progresses[j]+speeds[j]*days;
	        			i=j-1;
	        			list.add(count);
	        			break;
	        		}
	        	}
	        }
	        int[] answer = new int[list.size()];
	        for(int i=0;i<list.size();i++) {
	        	answer[i]=list.get(i);
	        }
	        return answer;
	    }

	public static void main(String[] args) {
		int[] progresses= {93,30,55};
		int[] speeds= {1,30,5};
		
		for(int i:solution(progresses,speeds)) {
			System.out.println(i);	
		}
		int a = 5;
		int b = 6;
		System.out.println(Math.ceil((double)a/b));
		
	}

}