每日温度
力扣题目链接
class Solution {
public:
vector<int> dailyTemperatures(vector<int>& temperatures) {
stack<int> st;
vector<int> result(temperatures.size(), 0);
for(int i = 0; i < temperatures.size(); i++){
if(st.empty() || temperatures[st.top()] >= temperatures[i]){
st.push(i);
}
else{
while(!st.empty() && temperatures[st.top()] < temperatures[i]){
result[st.top()] = i - st.top();
st.pop();
}
st.push(i);
}
}
return result;
}
};
下一个更大元素 I
力扣题目链接
class Solution {
public:
vector<int> nextGreaterElement(vector<int>& nums1, vector<int>& nums2) {
int len1 = nums1.size();
int len2 = nums2.size();
vector<int> result(len1, -1);
stack<int> st;
unordered_map<int, int> umap;
for(int i = 0; i < len1; i++){
umap[nums1[i]] = i;
}
for(int i = 0; i < len2; i++){
if(!st.empty() && st.top() < nums2[i]){
while(!st.empty() && st.top() < nums2[i]){
if(umap.find(st.top()) != umap.end()){
result[umap[st.top()]] = nums2[i];
}
st.pop();
}
}
st.push(nums2[i]);
}
return result;
}
};
下一个更大元素II
力扣题目链接
class Solution {
public:
vector<int> nextGreaterElements(vector<int>& nums) {
vector<int> result(nums.size(), -1);
stack<int> st;
for(int i = 0; i < 2*nums.size(); i++){
int j = i % nums.size();
while(!st.empty() && nums[st.top()] < nums[j]){
result[st.top()] = nums[j];
st.pop();
}
st.push(j);
}
return result;
}
};