496. Next Greater Element I（C++）

题目

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.

class Solution {
public:
vector<int>nextGreaterElement(vector<int>&findNums, vector<int>&nums) {

    }
};

翻译：

给两个数组（没有重复数字）num1和num2，其中num1是num2的子集，在nums2的相应位置中查找nums1的所有下一个更大的数字。
下一个更大的数字是指num1中存在的在num2中这个数字右边第一个比它大的数字。如果不存在（包括不存在num1中的数字，也包括不存在比num1中数字还大的在右边的数字），则输出-1。
例如：

1. Input: nums1 = [4,1,2], nums2 = [1,3,4,2].
   Output: [-1,3,-1]

2. Input: nums1 = [2,4], nums2 = [1,2,3,4].
   Output: [3,-1]

注意：
nums1和nums2中的所有元素都是唯一的。
nums1和nums2的长度不会超过1000。

思路：

第一个想法是两次循环，比较，注意细节

解答：

class Solution {
public:
vector<int> nextGreaterElement(vector<int>& findNums, vector<int>& nums) 
{
    int sz1 = findNums.size();
    int sz2 = nums.size();
    vector<int> ret(sz1, int());
    for (int i = 0; i < sz1; ++i)
    {
        int j = 0;
        for (j = 0; j < sz2; ++j)
        {
            if (nums[j] == findNums[i])
                break;
        }
        if (j == sz2)
            ret[i] = -1;
        else{
            int k = 0;
            for (k = j + 1; k < sz2; ++k)
            {
                if (nums[k] > nums[j])
                {
                    ret[i] = nums[k];
                    break;
                }
            }
            if (k == sz2) ret[i] = -1;
        }
    }
    return ret;
};