题目

法1：单调栈+循环数组

class Solution {public int[] nextGreaterElements(int[] nums) {int n = nums.length;int[] res = new int[n];Stack<Integer> stack = new Stack<>();for (int i = 2 * n - 1; i >= 0; --i) { // 循环数组处理!!!while (!stack.isEmpty() && nums[i % n] >= stack.peek()) {stack.pop();}res[i % n] = stack.isEmpty() ? -1 : stack.peek();stack.push(nums[i % n]);}return res;}
}