503. Next Greater Element II

Given a circular array (the next element of the last element is the first element of the array), print the Next Greater Number for every element. The Next Greater Number of a number x is the first greater number to its traversing-order next in the array, which means you could search circularly to find its next greater number. If it doesn't exist, output -1 for this number.

Example 1:

Input: [1,2,1]
Output: [2,-1,2]
Explanation: The first 1's next greater number is 2; 
The number 2 can't find next greater number; 
The second 1's next greater number needs to search circularly, which is also 2.

 

Note: The length of given array won't exceed 10000.

方法一：直接求解，时间复杂度较高，O（n2），可AC，程序如下所示：

class Solution {
    public int[] nextGreaterElements(int[] nums) {
        if (nums.length == 0){
            return new int[0];
        }
        int[] res = new int[nums.length];
        for (int i = 0; i < nums.length; ++ i){
            int tmp = (i + 1)%nums.length;
            while (nums[tmp] <= nums[i]){
                if (tmp == i){
                    res[i] = -1;
                    break;
                }
                tmp = (tmp+1)%nums.length;
            }
            res[i] = res[i] == -1?-1:nums[tmp];
        }
        return res;
    }
}

方法二：通过一个栈求解，时间复杂度为线性，程序如下所示：

class Solution {
    public int[] nextGreaterElements(int[] nums) {
        int[] res = new int[nums.length];
        Arrays.fill(res, -1);
        ArrayDeque<Integer> stack = new ArrayDeque<>();
        for (int i = 0; i < 2 * nums.length; ++ i){
            int index = nums[i%nums.length];
            while (!stack.isEmpty() && nums[stack.peek()] < index){
                res[stack.pop()] = index;
            }
            stack.push(i%nums.length);
        }
        return res;
    }
}