[Baekjoon/Python3] 10828번 스택

[Baekjoon/Python3] 10828번 스택

 

www.acmicpc.net/problem/10828

10828번: 스택

 

# LIFO
import sys
n = int(sys.stdin.readline())
stack = []
for i in range(n):
    s = sys.stdin.readline().split()
    if 'push' in s:
        stack.append(s[1])
    elif 'pop' in s:
        print(stack.pop() if stack else -1)
    elif 'size' in s:
        print(len(stack))
    elif 'empty' in s:
        print(0 if stack else 1)
    elif 'top' in s:
        print(stack[-1] if stack else -1)