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.

給定一個循環數組（最後一個元素的下一個元素是數組的第一個元素），為每個元素輸出Next Greater Number。下一個更大數字x是數組中第一個更大的數字，這意味著您可以循環搜索以找到下一個更大的數字。如果不存在，則輸出-1。

/**
 * @param {number[]} nums
 * @return {number[]}
 */
var nextGreaterElements = function (nums) {
    let res = [];
    res.length = nums.length;
    res.fill(-1);
    let stack = [];
    let index = 0;
    while (index < nums.length * 2) {
        let cur = nums[index % nums.length];
        while (stack.length 
 
> 0 && nums[stack[stack.length - 1]] < cur) {
            res[stack.pop()] = cur;
        }
        if (index < nums.length) stack.push(index);
        index++
    }
    return res;
};
//let nums = [2, 1, 1, 3];
let nums = [1, 2, 1];
let res = nextGreaterElements(nums);
console.log(res);

503. Next Greater Element II 下一個更大元素