法1:单调栈
必须掌握算法,关于单调栈、单调队列和环形队列相关参见《算法小抄》相关内容。
class Solution {
public int[] dailyTemperatures(int[] temperatures) {
int n = temperatures.length;
int[] res = new int[n];
Stack<Integer> s = new Stack<>();
for (int i = n - 1; i >= 0; --i) {
while (!s.isEmpty() && temperatures[s.peek()] <= temperatures[i]) {
s.pop();
}
res[i] = s.isEmpty() ? 0 : s.peek() - i;
s.push(i);
}
return res;
}
}