This is the Daily Temperatures problem at leetcode.com:
Given a list of daily temperatures, produce a list 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 temperatures = [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].
This code works for smaller inputs and fails for list of length 10,000. What would you recommend me to change or improve in this code?
class Solution(object): def dailyTemperatures(self, temperatures): """ :type temperatures: List[int] :rtype: List[int] """ #O(n2) #max(temperatures) res= for i in range(len(temperatures)): cnt=0 for j in range(i+1,len(temperatures)): cnt+=1 if temperatures[i]<temperatures[j]: res.append(cnt) cnt=0 break elif j==len(temperatures)-1: res.append(0) cnt=0 break res.append(0) return res