leetcode739.Daily Temperatures

原题链接https://leetcode.com/problems/daily-temperatures/
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].

刚开始把温度也入栈了，后面用索引加数组表示的温度,顺便简化了循环内语句。

class Solution:
    def dailyTemperatures(self, T: List[int]) -> List[int]:
        n = len(T)
        if n == 0 or n == 1:
            return []
        res = [0] * n
        stack = []
        # for i, t in enumerate(T):
        #     if not stack:
        #         stack.append((i, t))
        #     elif stack[-1][1] >= t:
        #         stack.append((i, t))
        #     else:
        #         while stack and stack[-1][1] < t:
        #             res[stack[-1][0]] = i - stack[-1][0]
        #             stack.pop()
        #         stack.append((i,t))
        # return res
    
        for i in range(n):
            for i in range(n):
            while stack and T[stack[-1]] < T[i]:
                res[stack[-1]] = i - stack[-1]
                stack.pop()
            stack.append(i)
        return res