leetcode-496. Next Greater Element 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.*/
解法1： 使用map存储nums2中每个元素的nextgreater元素，没有则为-1；

#include<iostream>
#include<map>
#include<vector>
using namespace std;
vector<int> nextGreaterElement(vector<int>& findNums, vector<int>& nums);
int main()
{
    vector<int> findnums{ 4,1,2 };
    vector<int> nums{ 1,3,4,2};
    vector<int> result = nextGreaterElement(findnums, nums);
    vector<int>::iterator it= result.begin();
    for (; it != result.end(); it++)
        cout << *it<<" ";
    return 0;

}
vector<int> nextGreaterElement(vector<int>& findNums, vector<int>& nums)
{
    unordered_map<int, int> nextgreater;
    vector<int> result;
    int len1 = nums.size();
    int len2 = findNums.size();
    if (len1 == 0 || len2 == 0)
        return result;
    for (int i = 0; i < len1-1; i++)
    {
        int j = i + 1;
        while (j<len1&&nums[i] >= nums[j])
            j++;
        if (j < len1)
            nextgreater[nums[i]] = nums[j];
        else
            nextgreater[nums[i]] = -1;
    }
    nextgreater[nums[len1 - 1]] = -1;//最后一个value为-1

    for (int i = 0; i < len2; i++)
    {

        result.push_back(nextgreater[findNums[i]]);
    }
    return result;
}

解法2：使用unordered_map和stack
该方法利用stack，push和pop的次数最多为2N，便可得出所有存在greater的元素的greater.

vector<int> nextGreaterElement1(vector<int>& findNums, vector<int>& nums)
{
    unordered_map<int, int> nextgreater;
    vector<int> result;
    stack<int> temp;
    for (int n : nums)
    {
        while (temp.size() && n > temp.top())
        {
            nextgreater[temp.top()] = n;
            temp.pop();
        }

        temp.push(n);
    }

    for (int n : findNums) result.push_back(nextgreater.count(n) ? nextgreater[n]: -1);
    return result;
}