https://school.programmers.co.kr/learn/courses/30/lessons/154539
def solution(numbers):
stack = []
answer = [-1] * len(numbers)
for i in range(len(numbers)):
while stack and numbers[stack[-1]] < numbers[i]: #stack에 값이 없을때까지
answer[stack.pop()] = numbers[i]
stack.append(i)
return answer