LeetCode 739 python刷题

题目：

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(object):
    def dailyTemperatures(self, T):
        """
        :type T: List[int]
        :rtype: List[int]
        """
        l=len(T)
        a=[0]*l
        for i in range(l):
            p=0
           
                
            for j in range(i,l):
                    
                if T[j]>T[i]:
                    p=j-i
                    a[i]=p
                    
                    break
      
        return a
                
         

比较好的方法使用堆栈实现的，例如：

class Solution:
    def dailyTemperatures(self, T):
        """
        :type T: List[int]
        :rtype: List[int]

        """
        res = [0] * len(T)
        stack = []
        for i, t in enumerate(T):
            while stack and T[stack[-1]] < t:  #出现比原来的大的时候，原来的出栈
                cur = stack.pop()
                res[cur] = i - cur
            stack.append(i)

        return res