파이썬 알고리즘
백준 2164 카드2 deque
나미-IT
2022. 1. 26. 19:55
from collections import deque
deq = deque()
N = int(input())
deq = deque([i for i in range(1,N+1)])
while len(deq)>=1:
if len(deq) == 1:
print(deq.pop())
break
else:
deq.popleft()
deq.rotate(-1)
덱 deque
기본함수
from collections import deque
deq = deque()
deq = deque([i for i in range(1,5)])
deq.appendleft(10)
deq.append(-10)
deq.pop()
deq.popleft()
len(deq)
print(deq)
deq.rotate(-1) #음수이면 왼쪽으로 회전