[백준 문제풀이] 10828번 : 스택

출처: https://www.acmicpc.net/problem/10828

10828번: 스택

 

1. 소스코드

import sys

N=int(sys.stdin.readline())
stack=[]
for i in range(N):
    word=sys.stdin.readline().split()
    order=word[0]

    if order=="push":
        stack.append(word[1])

    elif order=="pop":
        if len(stack)==0:
            print(-1)
        else:
            print(stack.pop())

    elif order=="size":
        print(len(stack))

    elif order =="empty":
        if len(stack)==0:
            print(1)
        else:
            print(0)
            
    elif order=="top":
        if len(stack)==0:
            print(-1)
        else:
            print(stack[-1])