Given a list of daily temperatures T
, return a list such that, for each day in the input, tells you how many days you would have to wait until a warmer temperature. If there is no future day for which this is possible, put 0
instead.
For example, given the list of temperatures T = [73, 74, 75, 71, 69, 72, 76, 73]
, your output should be [1, 1, 4, 2, 1, 1, 0, 0]
.
Note: The length of temperatures
will be in the range [1, 30000]
. Each temperature will be an integer in the range [30, 100]
.
思路:求当天需要等多少天升温,也即是遇到温度更高的时候出栈所以维护一个单调递减栈;
代码:
class Solution {
public:
vector<int> dailyTemperatures(vector<int>& T) {
stack<int> st;vector<int> ans(T.size());
for(int i=0;i<T.size();i++){
while(!st.empty()&&T[st.top()]<T[i]){
ans[st.top()]=i-st.top();
st.pop();
}
st.push(i);
}
return ans;
}
};