1、题目
https://leetcode-cn.com/problems/daily-temperatures/
2、题意
题解1:栈stack
class Solution {
public:
vector<int> dailyTemperatures(vector<int>& T) {
stack<int> s;
int m = T.size();
vector<int> res(m,0);
for(int i=0;i<m;i++)
{
while(!s.empty()&&T[i]>T[s.top()])
{
res[s.top()] = i-s.top();
s.pop();
}
s.push(i);
}
return res;
}
};