leetcode---C++实现---496. Next Greater Element I（下一个更大元素I）

题目

You are given two arrays (without duplicates) nums1 and nums2 where nums1’s elements are subset of nums2. Find all the next greater numbers for nums1’s elements in the corresponding places of nums2.

The Next Greater Number of a number x in nums1 is the first greater number to its right in nums2. If it does not exist, output -1 for this number.

Example 1:

Input: nums1 = [4,1,2], nums2 = [1,3,4,2].
Output: [-1,3,-1]
Explanation:
For number 4 in the first array, you cannot find the next greater number for it in the second array, so output -1.
For number 1 in the first array, the next greater number for it in the second array is 3.
For number 2 in the first array, there is no next greater number for it in the second array, so output -1.

Example 2:

Input: nums1 = [2,4], nums2 = [1,2,3,4].
Output: [3,-1]
Explanation:
For number 2 in the first array, the next greater number for it in the second array is 3.
For number 4 in the first array, there is no next greater number for it in the second array, so output -1.

Note:

• All elements in nums1 and nums2 are unique.
• The length of both nums1 and nums2 would not exceed 1000.

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/next-greater-element-i

解题思路

使用栈和map作为辅助；

1. 遍历nums2，若当前元素比栈顶元素小时，则将该元素压入栈中，否则将栈中元素依次弹出，指导栈顶元素不小于当前元素为止，此时，从栈中弹出的所有元素的下一个更大的元素都是当前元素；
2. 当nums2遍历完毕后，若栈中仍有元素，则栈中所有元素都没有下一个更大元素了，也就是栈中所有元素对应的下一个更大元素都为-1；
3. 使用map存储步骤1、2中判断出的元素与其下一个更大元素的映射关系；
4. 遍历nums1，从map中获取nums1元素对应的下一个更大元素，返回最终结果。

算法实现（C++）

class Solution {
public:
    vector<int> nextGreaterElement(vector<int>& nums1, vector<int>& nums2) {
        map<int, int> numNextGreaterMap;
        stack<int> numStack;
        int nums2Size = nums2.size();
        for (int i = 0; i < nums2Size; ++i)
        {
            int num = nums2[i];
            while (!numStack.empty() && numStack.top() < num)
            {
                numNextGreaterMap.insert(std::pair<int,int>(numStack.top(),num));
                numStack.pop();
            }
            numStack.push(num);    
        }
        while (!numStack.empty())
        {
            numNextGreaterMap.insert(std::pair<int,int>(numStack.top(),-1));
            numStack.pop();
        }

        vector<int> retVector;
        int nums1Size = nums1.size();
        for (int i = 0; i < nums1Size; ++i)
        {
            int num = nums1[i];
            retVector.push_back(numNextGreaterMap[num]);
        }
        return retVector;
    }
};