https://leetcode-cn.com/problems/daily-temperatures/
思路:单调栈的简单变形。
class Solution {
public:
vector<int> dailyTemperatures(vector<int>& T) {
stack<int> s;
int siz=T.size();
vector<int> ans(siz);
for(int i=0;i<siz;i++){
while(!s.empty()&&T[i]>T[s.top()])
ans[s.top()]=i-s.top(),s.pop();
s.push(i);
}
return ans;
}
};