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.
思路:
首先是完全循环的方式:
class Solution {
public:
vector<int> nextGreaterElement(vector<int>& nums1, vector<int>& nums2) {
vector<int> ans;
for(int n1:nums1){
int tmp = -1;
bool flag = false;
for(int n2:nums2){
if(flag && n1<n2){
tmp = n2;
break;
}
if(n1 == n2) flag = true;
}
ans.push_back(tmp);
}
return ans;
}
};
然后我们对这种方式稍加改进:
class Solution {
public:
vector<int> nextGreaterElement(vector<int>& nums1, vector<int>& nums2) {
vector<int> ans;
map<int,int> m;
for(int i=0;i<nums2.size();i++) m[nums2[i]] = i;
for(int n1:nums1){
int tmp = -1;
for(int i=m[n1];i<nums2.size();i++){
if(n1<nums2[i]){
tmp = nums2[i];
break;
}
}
ans.push_back(tmp);
}
return ans;
}
};
最后方法使用stack将nums2中的next greater number记录下来:
class Solution {
public:
vector<int> nextGreaterElement(vector<int>& nums1, vector<int>& nums2) {
map<int,int> m;
stack<int> s;
for(int n:nums2){
while(!s.empty() && s.top()<n){
m[s.top()] = n;
s.pop();
}
s.push(n);
}
while(!s.empty()){
m[s.top()] = -1;
s.pop();
}
vector<int> ans;
for(int n:nums1) ans.push_back(m[n]);
return ans;
}
};