Level2 주식가격

def solution(prices):
    stack = []
    n = len(prices)
    d = [n-i-1 for i in range(n)]
    
    for i in range(n):
        if(len(stack)==0): stack.append([prices[i],i])
        else:
            while True:
                if(len(stack)==0): stack.append([prices[i],i]); break
                top = stack[-1]
                if(top[0]>prices[i]): stack.pop(); d[top[1]]=(i-top[1])
                elif(top[0]<=prices[i]): stack.append([prices[i],i]); break     
                else: break    
    return d