[Programmers] (스택/큐) Lv 2. 프린터

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

프로그래머스

 

function solution(priorities, location) {
    const recursive = (res, data) => {
        if (!data.some((e, i) => data[0] < e && 0 < i)) {
            if (0 == location) return res.length + 1;
            res.push(data[0]);
            --location;
        }
        else {
            location = (location - 1 < 0) ? data.length - 1 : location - 1;
            data.push(data[0]);
        }
        data.shift();
        return recursive(res, data);
    };

    return recursive([], priorities);
}

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/42587.%E2%80%85%ED%94%84%EB%A6%B0%ED%84%B0

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