(Medium) Daily Temperatures LeetCode

Description:

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

Solution:

class Solution {
    public int[] dailyTemperatures(int[] T) {
        
        if(T==null||T.length==0){
            return null;
        }
        
        int [] res = new int[T.length];
        
       
        
        for(int i = 0; i<T.length-1; i++){
           
          for(int j = i+1; j<T.length; j++){
              
              
              if(T[j]>T[i]){
                  
                  res [i] = j-i;
                  break;
                 
              }
               
          }
        }
        
        res[T.length-1]=0;
        
        return res;
    }
}

 

转载于:https://www.cnblogs.com/codingyangmao/p/11310108.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值