leetcode讲解–739. Daily Temperatures

34次阅读

共计 668 个字符,预计需要花费 2 分钟才能阅读完成。

题目
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].
题目地址
讲解
这道题挺简单的,往后找比当前温度大的就行了。
Java 代码
class Solution {
public int[] dailyTemperatures(int[] T) {
int[] result = new int[T.length];
for(int i=0;i<T.length;i++){
int index = i+1;
while(index<T.length && T[index]<=T[i]){
index++;
}
if(index==T.length){
result[i] = 0;
}else{
result[i] = index-i;
}
}
return result;
}
}

正文完
 0