任务描述
思路
- 维护一个递增栈
代码实现
class Solution(object):
def dailyTemperatures(self, T):
"""
:type T: List[int]
:rtype: List[int]
"""
stack = []
days = [0 for _ in range(len(T))]
for i in range(len(T)-1,-1,-1):
while len(stack)!=0 and T[stack[-1]]<=T[i]:
stack.pop()
if stack:
days[i] = stack[-1]-i
stack.append(i)
return days