[BaekJoon] - 10828 스택

 

10828번: 스택

#!/bin/python3

def top(stack):
    if len(stack):
        return stack[::-1][0]
    else:
        return -1
    
def size(stack):
    return len(stack)

def empty(stack):
    if len(stack) == 0:
        return 1
    else:
        return 0

def pop(stack):
    if len(stack):
        return stack.pop()
    else:
        return -1
    
def push(stack, operation):
    stack.append(operation)

if __name__ == "__main__":
    stack = list()
    operation = list()
    count = int(input(""))
    
    while count > 0:
        operation.append(input("").split(" "))
        count -= 1
    
    for op in operation:
        if len(op) == 1:
            if op[0] == 'top':
                print(top(stack))
            elif op[0] == "size":
                print(size(stack))
            elif op[0] == "empty":
                print(empty(stack))            
            elif op[0] == "pop":
                print(pop(stack))
        else:
            push(stack, op[1])