[Programmers] Lv 2. 택배상자

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

프로그래머스

 

function solution(order) {
    let [result, box] = [0, 1];
    const stack = [];

    for (find of order) {
        while (true) {
            if (box === find) {
                ++box;
                break;
            } else if (stack.at(-1) === find) {
                stack.pop();
                break;
            } else {
                if (box < order.length) stack.push(box++);
                else return result;
            }
        }
        ++result;
    }

    return result;
}

GitHub : https://github.com/developeSHG/Algorithm-Baekjoon_Programmers/tree/main/%ED%94%84%EB%A1%9C%EA%B7%B8%EB%9E%98%EB%A8%B8%EC%8A%A4/lv2/131704.%E2%80%85%ED%83%9D%EB%B0%B0%EC%83%81%EC%9E%90

GitHub - developeSHG/Algorithm-Baekjoon_Programmers: 백준 and 프로그래머스 소스코드