Programmers | 택배상자

JavaStudy50.java

import java.util.Stack;
class Solution {
    public int solution(int[] order) {
        int answer = 0;
        Stack<Integer> conveyor = new Stack<>();
        for(int i=1; i<=order.length; i++){
            conveyor.push(i);
            while(!conveyor.isEmpty()){
                if(conveyor.peek() == order[answer]){
                    answer++;
                    conveyor.pop();
                } else break;
            }
        }
        
        return answer;
    }
}

https://school.programmers.co.kr/learn/courses/30/lessons/131704