덱2(28279)https://www.acmicpc.net/problem/28279 문제코드queue를 활용한 풀이queue.append, queue.appendleft, queue.pop, queue.popleft 에 대해서 잘 숙지하자# 덱 2# 28279from collections import dequeimport sysinput = sys.stdin.readlineN = int(input())queue = deque()for i in range(N): order = list(map(int, input().split())) if order[0] == 1: queue.appendleft(order[1]) elif order[0] == 2: queue.appe..
