[백준/baekjoon] 28279번 덱2 (파이썬)

내 제출

import sys
from collections import deque

# 명령의 수 N이 주어진다 (1 ≤ N ≤ 1,000,000)
n = int(input())
deque = deque()

# n 개의 줄에 명령이 하나씩 주어진다.
for _ in range(n):
    command = list(map(int, sys.stdin.readline().split()))

    if command[0] == 1:
        deque.appendleft(command[1])
    elif command[0] == 2:
        deque.append(command[1])
    elif command[0] == 3:
        print(deque.popleft() if deque else -1)
    elif command[0] == 4:
        print(deque.pop() if deque else -1)
    elif command[0] == 5:
        print(len(deque))
    elif command[0] == 6:
        print(1 if not deque else 0)
    elif command[0] == 7:
        print(deque[0] if deque else -1)
    elif command[0] == 8:
        print(deque[-1] if deque else -1)

 

결과

 

파이썬 덱(deque)참고 : https://mong9data.tistory.com/50

[자료구조][파이썬/Python] 덱 (Deque)

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

28279번: 덱 2