[프로그래머스] Lv.2 뒤에 있는 큰 수 찾기

 

[문제]

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

프로그래머스

 

 

[소스 코드]

import java.util.*;
class Solution {
    public int[] solution(int[] numbers) {
        Stack<Integer> stack = new Stack<>();
        int n = numbers.length;
        int[] answer = new int[n];
        for(int i=n-1;i>=0;i--){
            int target = numbers[i];
            while(!stack.isEmpty() && stack.peek()<=target){
                stack.pop();
            }
            answer[i] = stack.isEmpty() ? -1 : stack.peek();
            stack.push(target);
        }
        return answer;
    }
}