[LeetCode] 503. Next Greater Element II

题目链接: https://leetcode.com/problems/next-greater-element-ii/description/

Description

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.

解题思路

解题思路与 [LeetCode] 496. Next Greater Element I 基本一样，不同点在于数组变成了循环数组。通过遍历两次数组来模拟循环数组，这种方法用一个 for 循环就可以做到，即将遍历从 (n - 1) -> 0 变为 (2n - 1) -> 0，然后通过取模即可。另外，这道题没有限制数组中不能有重复的，所以栈顶的判断要变为小于等于，即 nums[s.top()] <= nums[i % nums.size()]，确保找到的是大于当前元素 x 的值。

Code

class Solution {
public:
    vector<int> nextGreaterElements(vector<int>& nums) {
        vector<int> res(nums.size());
        stack<int> s;
        for (int i = 2 * nums.size() - 1; i >= 0; --i) {
            while (!s.empty() && s.top() <= nums[i % nums.size()]) {
                s.pop();
            }
            res[i % nums.size()] = s.empty() ? -1 : s.top();
            s.push(nums[i % nums.size()]);
        }
        return res;
    }
};