[Programmers] (stack) Lv 2. 뒤에 있는 큰 수 찾기

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

프로그래머스

 

solution = (numbers) => {
    return Array(numbers.length)
        .fill(-1)
        .reduce((stack, el, idx, arr) => {
            while (stack && numbers[stack.at(-1)] < numbers[idx])
                arr[stack.pop()] = numbers[idx];
            stack.push(idx);
            return idx === numbers.length - 1 ? arr : stack;
        }, []);
};

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/unrated/154539.%E2%80%85%EB%92%A4%EC%97%90%E2%80%85%EC%9E%88%EB%8A%94%E2%80%85%ED%81%B0%E2%80%85%EC%88%98%E2%80%85%EC%B0%BE%EA%B8%B0

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