下一個(gè)更大元素 II

class Solution {
    public int[] nextGreaterElements(int[] nums) {
        int[] res = new int[nums.length];
        Arrays.fill(res,-1);
        //定義單調(diào)棧
        Deque<Integer> stack  = new ArrayDeque<>();
        //從0開始
        for(int i = 0;i <  nums.length;i++){
            //找到會更新單調(diào)棧
            while(!stack.isEmpty()&&nums[stack.peek()] < nums[i]){
                int index = stack.pop();
                res[index] = nums[i];
            }
            //之后往棧加入自己
            stack.push(i);
        }
        //遍歷一遍之后,從頭開始尋找未找到的
        while(!stack.isEmpty()){
            int index  = stack.pop();
            for(int i = 0;i < index;i++){
                if(nums[i] > nums[index]){
                    res[index] = nums[i];
                    break;
                }
            }
        }

        return res;
    }
}