题目:
思路:
单调栈
代码:
class Solution {
public int[] dailyTemperatures(int[] temperatures) {
Stack<Integer> stack = new Stack<>();
int[] ret=new int[temperatures.length];
for (int i=0;i<temperatures.length;i++){
int temperature = temperatures[i];
while (!stack.isEmpty()&&temperature>temperatures[stack.peek()]){
ret[stack.peek()]=i-stack.pop();
}
stack.push(i);
}
return ret;
}
}