题目

法1：典型单调栈问题

class Solution {public int[] dailyTemperatures(int[] temperatures) {int n = temperatures.length;int[] res = new int[n];Stack<Integer> stack = new Stack<>();for (int i = n - 1; i >= 0; --i) {while (!stack.isEmpty() && temperatures[i] >= temperatures[stack.peek()]) {stack.pop();}res[i] = stack.isEmpty() ? 0 : stack.peek() - i;stack.push(i);}return res;}
}