LeetCode 739. Daily Temperatures

最新推荐文章于 2022-08-29 23:51:16 发布

i_chase

最新推荐文章于 2022-08-29 23:51:16 发布

阅读量177

点赞数 1

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/qq_39638957/article/details/90719987

博客围绕给定每日温度列表，要求返回一个列表，该列表能表明对于输入中的每一天，需等待多少天才能迎来更暖和的温度，若不存在这样的未来日期则用特定值替代，并给出了示例及相关数据范围。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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].

Note: The length of temperatures will be in the range [1, 30000]. Each temperature will be an integer in the range [30, 100].

class Solution {
    public int[] dailyTemperatures(int[] T) {
        int[] res = new int[T.length];//初始全为0
        Stack<Integer> stack = new Stack<>();
        for(int i = 0;i<T.length;i++){
            //stack中的气温在出栈时是从小到大的顺序出栈的
            while(!stack.isEmpty() && T[i]>T[stack.peek()]){//T[i]比之前的气温高
                res[stack.peek()] = i - stack.peek();
                stack.pop();
            }
            stack.push(i);
        }
        return res;
    }
}