【LeetCode】739. Daily Temperatures 栈的使用

【LeetCode】739. Daily Temperatures 栈的使用

Given a list of daily temperatures T, return a list such 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 of temperatures T = [73, 74, 75, 71, 69, 72, 76, 73], your output should be [1, 1, 4, 2, 1, 1, 0, 0].

思路

题目大意为算出所给数组中的每个数与下一个更大的数的index的距离。
即[a,b,c]中，a>b且c>a，则返回[2,1,0]。
使用单调栈（递减栈，顶到底的元素是递减的）就可以实现，每次Push元素前，检查一遍栈顶元素是否小于当前元素，小于则计算差值插入数组中。
进阶可以使用ArrayDeque或者数组实现

实现

public int[] dailyTemperatures(int[] temperatures) {
    Stack<Integer> stack = new Stack<>();
    int[] result = new int[temperatures.length];
    for(int i = 0; i < temperatures.length; i++) {
    	//温度小于则计算index差值并插入结果中
        while(!stack.isEmpty() && temperatures[i] > temperatures[stack.peek()]) {
            res[stack.peek()] = i - stack.pop();
        }
        //栈为空或不小于则当前index入栈
        stack.push(i);
    }
    return result;
}