Leetcode - Daily Temperatures Solution
1 min read

# Leetcode - Daily Temperatures Solution

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 in Python

class Solution:
def dailyTemperatures(self, T: List[int]) -> List[int]:
output = [0]*len(T)
warmer = [300002]*102
for index,value in reversed(list(enumerate(T))):
nearest_warmer = min(warmer[i] for i in range(value+1,102))
if nearest_warmer != 300002:
output[index] = nearest_warmer-index
warmer[value] = index
return output

# Adblocker detected! Please consider reading this notice.

We've detected that you are using AdBlock Plus or some other adblocking software which is preventing the page from fully loading.

That's okay. But without advertising-income, we can't keep making this site awesome.

We don't have any banner, Flash, animation, obnoxious sound, or popup ad. We do not implement these annoying types of ads!

We need money to operate the site, and almost all of it comes from our online advertising.

Please add thepoorcoder.com to your ad blocking whitelist or disable your adblocking software.

×