LeetCode 503. Next Greater Element II - 单调栈（Monotonic Stack）系列题2-CSDN博客

本文链接：https://blog.csdn.net/hgq522/article/details/122646996

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]
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.

Example 2:

Input: nums = [1,2,3,4,3]
Output: [2,3,4,-1,4]

Constraints:

1 <= nums.length <= 104
-109 <= nums[i] <= 109

这题也是要求一个数组中所有数的下一个更大数，但是给定的数组是首尾相连的循环数组，也就是说对于一个元素要是一直到数组最后还找不到下一个更大数，还得继续从数组头开始直到当前元素的前一个元素之间找，查找到前一个元素就可以停止了，再继续往后循环就都是重复的情况。因此这题解法是只要在496. Next Greater Element I的单调栈解法的基础遍历两遍数组就可以了。

class Solution:
    def nextGreaterElements(self, nums: List[int]) -> List[int]:
        n = len(nums)
        res = [-1 for _ in range(n)]
        st = []
        for i in range(2 * n):
            while st and nums[st[-1] % n] < nums[i % n]:
                res[st.pop() % n] = nums[i % n]
            
            st.append(i)
        
        return res