Leetcode 739. 每日温度

yeah_panda

于 2020-08-15 18:00:41 发布

阅读量98

点赞数

分类专栏： Leetcode 文章标签：栈 stack leetcode

本文链接：https://blog.youkuaiyun.com/weixin_39504758/article/details/108026159

版权

Leetcode 专栏收录该内容

25 篇文章

订阅专栏

739. 每日温度

class Solution:
    def dailyTemperatures(self, T):
        stack = []
        n = len(T)
        outputlist = [0] * n
        for i in range(n):
            while stack != [] and T[i] > T[stack[-1]]:
                top =stack.pop()
                outputlist[top] = i - top
            stack.append(i)
        return outputlist