Question:
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].
Solution:
想了一会想到了栈,一开始想的是放入栈中的是下标和数值,因此想弄一个新的结构体放这两个值,后来AC后看到别人只用下标,不禁怀疑自己的智商。
大概的思路是,维护一个栈,栈中放着的元素数值大小自栈顶往下递增,而且栈中的元素都是未找到更大的数的元素。初始化时栈中放着第一个元素。然后遍历数组,遇到一个数后,将这个数与栈顶比较,如果比栈顶大,则为栈顶的元素找到了一个更大的数,可以弹出,不断弹出知道当前的数比栈顶的数大或相等。这样就能得到最终答案。
class Solution {
public:
vector<int> dailyTemperatures(vector<int>& temperatures) {
stack<int> st;
vector<int> ret(temperatures.size(), 0);
if (temperatures.size() == 0) return ret;
st.push(0);
for (int i = 1; i < temperatures.size(); i++) {
while (!st.empty() && temperatures[st.top()] < temperatures[i]) {
ret[st.top()] = i - st.top();
st.pop();
}
st.push(i);
}
return ret;
}
};