739. 每日温度
https://leetcode.cn/problems/daily-temperatures/submissions/560962287/
class Solution {
public:
vector<int> dailyTemperatures(vector<int>& temperatures) {
stack<int> st;
vector<int> result(temperatures.size(),0);
st.push(0);
for(int i = 1; i <temperatures.size(); i++){
if(temperatures[i] < temperatures[st.top()]){
st.push(i);
}else if (temperatures[i] == temperatures[st.top()]){
st.push(i);
}else{
while(!st.empty()&& temperatures[i] > temperatures[st.top()]){
result[st.top()] = i - st.top();
st.pop();
}
st.push(i);
}
}
return result;
}
};
496.下一个更大元素 I
https://leetcode.cn/problems/next-greater-element-i/description/
class Solution {
public:
vector<int> nextGreaterElement(vector<int>& nums1, vector<int>& nums2) {
stack<int> st;
vector<int> result(nums1.size(),-1);
if(nums1.size() == 0)
return result;
unordered_map<int,int> umap;
for(int i=0; i< nums1.size(); i++){
umap[nums1[i]] = i;
}
st.push(0);
for (int i = 1; i< nums2.size(); i++){
if(nums2[i] < nums2[st.top()]) {
st.push(i);
} else if (nums2[i] == nums2[st.top()]) {
st.push(i);
} else {
while (!st.empty() && nums2[i] > nums2[st.top()]) {
if (umap.count(nums2[st.top()]) > 0) {
int index = umap[nums2[st.top()]];
result[index] = nums2[i];
}
st.pop();
}
st.push(i);
}
}
return result;
}
};
503.下一个更大元素II
https://leetcode.cn/problems/next-greater-element-ii/
class Solution {
public:
vector<int> nextGreaterElements(vector<int>& nums) {
vector<int> nums1(nums.begin(), nums.end());
nums.insert(nums.end(), nums1.begin(), nums1.end());
vector<int> result(nums.size(), -1);
if (nums.size() == 0) return result;
stack<int> st;
st.push(0);
for (int i = 1; i < nums.size(); i++) {
if (nums[i] < nums[st.top()]) st.push(i);
else if (nums[i] == nums[st.top()]) st.push(i);
else {
while (!st.empty() && nums[i] > nums[st.top()]) {
result[st.top()] = nums[i];
st.pop();
}
st.push(i);
}
}
result.resize(nums.size() / 2);
return result;
}
};