法一:暴力搜索
class Solution {
public:
vector<int> nextGreaterElement(vector<int>& nums1, vector<int>& nums2) {
vector<int> res;
for(int i = 0; i < nums1.size(); i++){
int flag = 0;
for(int j = 0; j < nums2.size(); j++){
if(flag == 0 && nums2[j] == nums1[i]){
flag = 1;
}
else if(flag == 1 && nums2[j] > nums1[i]){
res.push_back(nums2[j]);
break;
}
}
if(res.size() != i + 1)
res.push_back(-1);
}
return res;
}
};
法二:单调栈+哈希表
class Solution {
public:
vector<int> nextGreaterElement(vector<int>& nums1, vector<int>& nums2) {
stack<int> st;
vector<int> res(nums1.size(), -1);
unordered_map<int, int> unmap;
for(int i = 0; i < nums1.size(); i++){
unmap[nums1[i]] = i;
}
st.push(0);
for(int i = 1; i < nums2.size(); i++){
if(nums2[i] <= nums2[st.top()])
st.push(i);
else{
while(!st.empty() && nums2[i] > nums2[st.top()]){
if(unmap.count(nums2[st.top()]) > 0){
int idx = unmap[nums2[st.top()]];
res[idx] = nums2[i];
}
st.pop();
}
st.push(i);
}
}
return res;
}
};