1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
def solution(numbers):
    answer = []
    stack = []
    answer = [-1 for i in range(len(numbers))]
    for i, ele in enumerate(numbers):
        while stack and numbers[stack[-1]] < numbers[i]:
            answer[stack.pop()] = numbers[i]
        stack.append(i)
        # answer.append(-1)

#         checklist = ([num>ele for num in numbers[i+1:]])
#         if sum(checklist) == 0:
#             continue

#         for n in numbers[i+1:]:
#             if n>ele:
#                 answer[-1] = n
#                 break
    return answer