题目:
Given a list of daily temperatures
, produce a list 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 temperatures = [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就完成了题目的要求
c++代码:
class Solution {
public:
vector<int> dailyTemperatures(vector<int>& temperatures) {
stack<pair<int, int>> rest;
vector<int> res(temperatures.size(), 0);
for(int i = 0; i < temperatures.size(); ++i) {
if(!res.empty()) {
while(!rest.empty()) {
pair<int, int> r = rest.top();
if(r.second >= temperatures[i]) break;
rest.pop();
res[r.first] = (i - r.first);
}
}
rest.push(make_pair(i, temperatures[i]));
}
return res;
}
};