[백준] 10845번 큐 풀이

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

1.문제

2.Code

import sys


def push(x):
    queue.append(x)


def pop():
    if queue:
        return queue.pop(0)
    else:
        return -1


def size():
    return len(queue)


def empty():
    return 0 if queue else 1


def front():
    return queue[0] if queue else -1


def back():
    return queue[size() - 1] if queue else -1


queue = []
A = int(sys.stdin.readline().rstrip())

for i in range(A):
    cmd = sys.stdin.readline().rstrip().split()
    command = cmd[0]

    if command == 'push':
        push(cmd[1])
    elif command == 'pop':
        print(pop())
    elif command == 'size':
        print(size())
    elif command == 'empty':
        print(empty())
    elif command == 'front':
        print(front())
    elif command == 'back':
        print(back())