LeetCode 503. Next Greater Element II

最新推荐文章于 2024-06-24 09:27:52 发布

Edwardwe

最新推荐文章于 2024-06-24 09:27:52 发布

阅读量356

点赞数

分类专栏： C++，LeetCode

本文链接：https://blog.csdn.net/Edwardwe/article/details/57083861

版权

C++，LeetCode 专栏收录该内容

11 篇文章 0 订阅

订阅专栏

503. Next Greater Element II

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.

class Solution {
public:
    vector<int> nextGreaterElements(vector<int>& nums) {
        int count=nums.size();
        vector<int> feback;//创建返回数组
        for(int i=0;i<count;i++)
        {
            int k=0;
            for(int j=(i+1)%count;k<count;k++)
            {
                if(nums[j]>nums[i])
                {
                    feback.push_back(nums[j]);
                    break;
                }
                else j=(j+1)%count;
            }
            if(k==count) feback.push_back(-1);
        }
        return feback;
    }
};