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
andnums2
are unique. - The length of both
nums1
andnums2
would not exceed 1000.
my answer:
class Solution {
public:
vector<int> nextGreaterElement(vector<int>& findNums, vector<int>& nums) {
vector<int>a;
int b=-1;
for(int i=0;i<findNums.size();i++)
{
for(int j=0;j<nums.size();j++)
{
if(findNums[i]==nums[j])
{
if(j==nums.size())
a.push_back(-1);
else
{
for(int k=j;k<nums.size();k++)
{
if(findNums[i]<nums[k])
{
a.push_back(nums[k]);
break;
}
if(k==nums.size()-1)
a.push_back(-1);
}
}
}
}
}
return a;
}
};
总结:
本题其实并不难,但是有几点却是需要注意的:
1.做题前要先把思路勾画好,否则极容易混乱。尤其分好if的条件。
2.for的套用,以及if的运用。当满足条件时,不需要继续进行for下边的操作时,要懂得巧妙地运用break跳出for循环;
3.此题要求的并不是只后一个数是否比本身大,而是之后便所有的数是否比本身大。如果有则返回最近的那个数。如果没有则返回-1.