forked from Divya063/LeetCode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
daily-temperatures.py
28 lines (26 loc) · 997 Bytes
/
daily-temperatures.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
# Time: O(n)
# Space: O(n)
# Given a list of daily temperatures, produce a list 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 temperatures = [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].
class Solution(object):
def dailyTemperatures(self, temperatures):
"""
:type temperatures: List[int]
:rtype: List[int]
"""
result = [0] * len(temperatures)
stk = []
for i in xrange(len(temperatures)):
while stk and \
temperatures[stk[-1]] < temperatures[i]:
idx = stk.pop()
result[idx] = i-idx
stk.append(i)
return result