261. Next Greater Element II

MediumStack

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.

Examples

Input: [1,2,1]

Output: [2,-1,2]

Explanation: The last 1 wraps around to the leading 2.

Constraints

  • 1 <= nums.length <= 10^4
  • -10^9 <= nums[i] <= 10^9
Loading...

Run checks all cases above. Submit evaluates all test cases.