주식 가격 [Python3]

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17

def solution(prices): answer = [] time = 0 for i in range(0, len(prices)): max = prices[i] for j in range(i, len(prices)-1): if max <= prices[j]: time += 1 else: break answer.append(time) time = 0 return answer