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.

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:

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

根据nums数组得到每个数的后一个比它大的数，然后根据findNums数组得到答案。用栈来实现找出每个数的后一个比它大的数。栈中保存从栈底到栈顶降序的数，对于当前的数，如果栈顶的数小于当前数，则表示当前数是栈顶的数的后一个比它大的数，出栈且记录好；循环直到栈顶的数大于当前数。

代码：

class Solution
{
public:
	vector<int> nextGreaterElement(vector<int>& findNums, vector<int>& nums) 
	{
		vector<int> res(findNums.size());
		stack<int> stk;
		map<int, int> res_map;

		for(auto num:nums)
		{
			res_map[num] = -1;
			while(!stk.empty() && stk.top() < num)
			{
				res_map[stk.top()] = num;
				stk.pop();
			}
			stk.push(num);
		}

		for(int i = 0; i < res.size(); ++i)
		{
			res[i] = res_map[findNums[i]];
		}

		return res;
	}
};