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].
题目要求找出最少需要多少天气温会比当天高,没有就为0。我先想到的是暴力法,但是有什么方法能降低时间复杂度呢?可以用栈结构。
分析:前三天都是后一天的温度比前一天高,故结果都为1.第三天75以后,温度降到71,比75小,然后又降到69,还是比75小,也比71小, 然后69又升到72,这时候72是比69高的,故可以算出69需要的天数,再往回看71也比72小,那么71的天数也可以算出来了,只有75还是比72大。这儿我们就发现猫腻了,没找到答案的先压着,然后遇到某符合条件再逆序弹出,这不就是栈嘛。这儿逆序弹出个数不定,所以需要用while循环。代码也就出来了
class Solution {
public:
vector<int> dailyTemperatures(vector<int>& T) {
vector<int> res;
if (T.empty()) return res;
res=vector<int>(T.size(),0);
stack<int> s;
for (int i=0;i<T.size();i++)
{
while(!s.empty()&&T[s.top()]<T[i])
{
int temp=s.top();
s.pop();
res[temp]=i-temp;
}
s.push(i);
}
return res;
}
};