0739. Daily Temperatures

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

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

## 代码 #

``````
package leetcode

// 解法一 普通做法
func dailyTemperatures(T []int) []int {
res, j := make([]int, len(T)), 0
for i := 0; i < len(T); i++ {
for j = i + 1; j < len(T); j++ {
if T[j] > T[i] {
res[i] = j - i
break
}
}
}
return res
}

// 解法二 单调栈
func dailyTemperatures1(T []int) []int {
res := make([]int, len(T))
var toCheck []int
for i, t := range T {
for len(toCheck) > 0 && T[toCheck[len(toCheck)-1]] < t {
idx := toCheck[len(toCheck)-1]
res[idx] = i - idx
toCheck = toCheck[:len(toCheck)-1]
}
toCheck = append(toCheck, i)
}
return res
}

``````

Apr 8, 2023