[백준] 10866 python - 덱(실버 4)

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

1트

덱은 선형자료구이다.

요소가 양쪽 끝 모두에 들어가고 나올 수 있다.

내 풀이

import sys
from collections import deque

cmd_case_num = int(sys.stdin.readline())

_deque = deque()
for _ in range(cmd_case_num):
    cmd_list = sys.stdin.readline().rstrip().split()

    if len(cmd_list) == 2:
        cmd, element = cmd_list
    else:
        cmd = cmd_list[0]

    if cmd == "push_front":
        _deque.appendleft(element)
        continue
    if cmd == "push_back":
        _deque.append(element)
        continue
    elif cmd == "pop_front":
        result = -1 if len(_deque) == 0 else _deque.popleft()
    elif cmd == "pop_back":
        result = -1 if len(_deque) == 0 else _deque.pop()
    elif cmd == "size":
        result = len(_deque)
    elif cmd == "empty":
        result = 1 if len(_deque) == 0 else 0
    elif cmd == "front":
        result = -1 if len(_deque) == 0 else _deque[0]
    elif cmd == "back":
        result = -1 if len(_deque) == 0 else _deque[-1]

    print(result)