# Leetcode 503 - Next greater element II

`Note:`

- Concat
`nums[0, len - 2]`

to nums to build a new array. - Use
`nums[i % len]`

to map index. - Actually, you can either iterate backwards or forwards to build a monotone stack.

`Question:`

Given a `circular`

integer array nums (i.e., the next element of nums[nums.length - 1] is nums[0]), return the next greater number for every element in nums.

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, return `-1`

for this number.

`Example:`

1 | Input: nums = [1,2,1] |

`Code:`

1 | /** |