class Solution {
public:
vector<int> dailyTemperatures(vector<int>& temperatures) {
stack<int> S;
int size=temperatures.size();
vector<int>res(size,0);
for(int i=0;i<size;++i){
while(!S.empty()&&temperatures[i]>temperatures[S.top()]){
int preIndex=S.top();
res[preIndex]=i-preIndex;
S.pop();
}
S.push(i);
}
return res;
}
};
剑指 Offer II 038. 每日温度 (单调递减栈)
最新推荐文章于 2024-07-14 11:23:58 发布