739. 每日温度
https://leetcode.cn/problems/daily-temperatures/
class Solution {
public:
vector<int> dailyTemperatures(vector<int>& temperatures) {
stack<int> stk;
vector<int> result (temperatures.size(), 0);
for (int i = 0; i < temperatures.size(); i++) {
while (!stk.empty() && temperatures[stk.top()] < temperatures[i]) {
result[stk.top()] = i - stk.top();
stk.pop();
}
stk.push(i);
}
return result;
}
};
496.下一个更大元素 I
https://leetcode.cn/problems/next-greater-element-i/
class Solution {
public:
vector<int> nextGreaterElement(vector<int>& nums1, vector<int>& nums2) {
vector<int> result(nums1.size(), -1);
unordered_map<int, int> umap;
stack<int> stk;
for (int i = 0; i < nums1.size(); i++) {
umap[nums1[i]] = i;
}
for (int i = 0; i < nums2.size(); i++) {
while(!stk.empty() && nums2[i] > nums2[stk.top()]) {
if (umap.find(nums2[stk.top()]) != umap.end()) {
result[umap[nums2[stk.top()]]] = nums2[i];
}
stk.pop();
}
stk.push(i);
}
return result;
}
};