LeetCode 739. Daily Temperatures 栈拧巴着放啥

最新推荐文章于 2022-08-29 23:51:16 发布

taoqick

最新推荐文章于 2022-08-29 23:51:16 发布

阅读量160

点赞数

分类专栏： leetcode 算法

本文链接：https://blog.csdn.net/taoqick/article/details/105259025

版权

算法同时被 2 个专栏收录

474 篇文章 6 订阅

订阅专栏

leetcode

231 篇文章 0 订阅

订阅专栏

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].

------------------------------------------------------------

这题和https://blog.csdn.net/taoqick/article/details/105334676（数数，所以是归并），形成了鲜明的对比，本题是下一个XXX的，用栈就好

这题和https://blog.csdn.net/taoqick/article/details/105450592 （右侧小于当前值最大的，排序值）形成了鲜明的对比，本题是右侧当前值最近的，排序位置就好。

class Solution:
    def dailyTemperatures(self, T: List[int]) -> List[int]:
        l = len(T)
        res,sta = [0 for i in range(l)],[]
        for i in range(l-1,-1,-1):
            while (sta and T[sta[-1]] <= T[i]):
                sta.pop()
            if (sta):
                res[i] = sta[-1]-i
            sta.append(i)
        return res