기능개발 LV2

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

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

 

 

import java.util.Arrays;
import java.util.Stack;


class Solution {
    public static int[] solution(int[] progresses, int[] speeds) {
        int[] answer = new int[progresses.length - 1];

        Stack<Pair<Integer, Integer>> stack = new Stack<>();

        for (int i = progresses.length - 1; i >= 0; i--) {
            stack.add(new Pair<>(progresses[i], speeds[i]));
        }

        int pivot = 0;
        boolean isDeploy = false;
        while (stack.size() > 0) {

            if (stack.peek().getKey() >= 100) {
                // 배포 시작
                isDeploy = true;
                answer[pivot] += 1;
                stack.pop();
            } else {

                if (isDeploy) {
                    pivot++;
                    isDeploy = false;
                }

                for (int i = 0; i < stack.size(); i++) {
                    stack.set(i, new Pair<>(stack.get(i).getKey() + stack.get(i).getValue(), stack.get(i).getValue()));
                }

            }

        }
        return Arrays.stream(answer).filter(i -> i != 0).toArray();
    }

    static class Pair<K, V> {

        Pair(K key, V value) {
            this.key = key;
            this.value = value;
        }

        K key;
        V value;

        K getKey() {
            return key;
        }

        V getValue() {
            return value;
        }
    }
}