[백준] 10845 큐 python 알고리즘 문제

문제 10845. 큐 1.

나의 코드와 발상 과정 import sys from collections import deque n = int(input()) queue = deque() for _ in range(n): order = sys.stdin.readline().strip() if order[0:4] == 'push': queue.appendleft(int(order[5:])) elif order[0:5] == 'front': if not queue: print(-1) else: print(queue[-1]) elif order[0:4] == 'back': if not queue: print(-1) else: [print(queue[0])] elif order[0:4] == 'size': print.....