Leetcode - Daily Temperatures
https://leetcode.com/problems/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].
type pair struct {
num int
count int
}
func dailyTemperatures(T []int) []int {
if len(T) == 0 {
return []int{}
}
stack := []pair{}
result := make([]int, len(T))
for i := len(T)-1; i >= 0; i-- {
if len(stack) == 0 {
stack = append(stack, pair{num: T[i], count: 0})
continue
}
count := 0
for len(stack) > 0 && stack[len(stack)-1].num <= T[i] {
count += stack[len(stack)-1].count
stack = stack[:len(stack)-1]
}
if len(stack) == 0 {
stack = append(stack, pair{num: T[i], count: 0})
continue
}
count++
stack = append(stack, pair{num: T[i], count: count})
result[i] = count
}
return result
}
评论 (0)
