프로그래머스 뒤에 있는 큰 수 찾기

풀이

---

def solution(numbers):
    answer = [-1]*len(numbers)
    stack=[]
    
    for idx in range(len(numbers)):
        while stack and numbers[idx]>numbers[stack[-1]]:
            answer[stack.pop()]=numbers[idx]
        stack.append(idx)

    return answer