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

스택을 이용해서 풀어야 했는데 아직 익숙하지 않아 배열로 끝내버렸다.

 

스택으로 연습할 것

 

import java.util.*;
class Solution {
    public int[] solution(int[] progresses, int[] speeds) {
        List<Integer> answerList = new ArrayList<>();
        List<Integer> progressesList = new ArrayList<>();
        List<Integer> speedsList = new ArrayList<>();
        int currentProgresses = 0;
        int complete = 100;
        for(int i : progresses) {
            progressesList.add(i);
        }
        for(int i : speeds) {
            speedsList.add(i);
        }
        while(progressesList.size() > 0) {
            for(int i =0; i<progressesList.size();i++) {
                int newProgress = progressesList.get(i) + speedsList.get(i);
                progressesList.set(i, newProgress);
            }
            
            int currentCompletedCount = 0;
            for(int i =0; i<progressesList.size();i++) {
                if(progressesList.get(i) >= complete) {
                    progressesList.remove(i);
                    speedsList.remove(i);
                    i--;
                    currentCompletedCount++;
                } else {
                    break;
                }
            }
            // System.out.println(progressesList);
            if(currentCompletedCount > 0) {
                answerList.add(currentCompletedCount);
            }
            currentProgresses++;
        }
        int[] answer = new int[answerList.size()];
        for(int i =0; i < answerList.size(); i++) {
            answer[i] = answerList.get(i);
        }
        return answer;
    }
}