leetcode739. Daily Temperatures(数组从后往前遍历)

Rudy Chan

于 2019-10-01 12:50:50 发布

阅读量196

点赞数

CC 4.0 BY-SA版权

分类专栏： mid

本文链接：https://blog.csdn.net/rudychan/article/details/101838552

mid 专栏收录该内容

44 篇文章

订阅专栏

本文介绍了一种用于预测未来温暖天气的算法。该算法接收一系列每日温度数据，并为每一天生成一个数值，表示需要等待多少天才能迎来更暖和的天气。如果之后没有更暖和的天气，则返回0。

摘要生成于 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];
        for(int i=T.length-1;i>=0;i--){
            if(i==T.length-1) res[i]=0;
            else{
             if(T[i]<T[i+1]){
                res[i]=1;
            }
            else{
                int temp=i+1;  
                int flag=0;
                while(temp<=T.length-1&&T[i]>=T[temp]){
                if(res[temp]==0){
                    flag=1;
                    break;
                }
                    else{
                        temp=temp+res[temp]; 
                    }                               
                }
                if(flag==1){
                    res[i]=0;
                }
                else{
                   res[i]=temp-i;  
                }
            }                
            } 
        }
        return res; 
    }
}