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.

思路：单调栈；tricky的地方，for循环< 2*n，num取模，因为stack里面存的是index，那么结果里面我只要i < n的index number；

class Solution {
    public int[] nextGreaterElements(int[] nums) {
        int n = nums.length;
        int[] res = new int[n];
        Arrays.fill(res, -1);
        HashMap<Integer, Integer> hashmap = new HashMap<>();
        Stack<Integer> stack = new Stack<>();
        for(int i = 0; i < 2 * n; i++) {
            int num = nums[i % n];
            while(!stack.isEmpty() && nums[stack.peek()] < num) {
                res[stack.pop()] = num;
            }
            if(i < n) {
                //  因为我只要计算0 ~ n 的next greater element；
               stack.push(i);
            }
        }
        return res;
    }
}