[백준/Python/파이썬] 10773번 제로 | 단계별로 풀어보기

1. 문제

https://www.acmicpc.net/problem/10773

 

 

2. 풀이

from collections import deque

stack = deque()
k = int(input())
result = 0

for _ in range(k):
    num = int(input())
    if num == 0:
        temp = stack.pop()
        result -= temp
    else:
        stack.append(num)
        result += num

# print(len(stack))
print(result)