用了单调栈栈内存的是温度数组的下标索引栈内加元素直到遇到比栈口大的值一直出栈直至栈口元素大于当前元素入栈class Solution { public int[] dailyTemperatures(int[] temperatures) { int[] res new int[temperatures.length]; StackInteger s new Stack(); for(int i 0;i temperatures.length;i){ if(s.isEmpty()){ s.push(i); }else if(temperatures[i] temperatures[s.peek()]){ s.push(i); }else{ while(!s.isEmpty() temperatures[i] temperatures[s.peek()]){ int k s.pop(); res[k] i - k; } s.push(i); } } return res; } }