LeetCode Stack Problem || Next Greater Element

题目描述

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.
**Difficulty：**Medium

---

解题思路

按题目的要求，输入一个数组，循环地找出数组中每一个元素的下一个比它大的元素，返回的数组中每一位表示输入数组的对应位置的下一个更大数字。有两个难点：
1. 如何解决循环查找的问题？
2. 如何使用栈？
首先定义一个新vector，将每一位初始化为-1；
为了解决循环问题，将vector nums读取两次，即设置循环终止条件为2 * nums.size()。每次循环与栈顶坐标对应元素比较大小，更大则将该栈顶坐标弹出；i小于nums.size()时，则将push入栈。

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