prices return
[1, 2, 3, 2, 3][4, 3, 1, 1, 0]
def solution(prices):
answer = [0]*len(prices)
for i in range(len(prices)-1):
count = 0
for j in range(i+1,len(prices)):
count += 1
if prices[i] > prices[j] :
break
answer[i] = count
return answer
문제 : https://programmers.co.kr/learn/courses/30/lessons/42584