본문 바로가기
leetcode 풀이/큐, 스택 (Array)

boj-11866. 요세푸스 문제

by 튼튼한개발자 2023. 1. 19.
import collections

N, K = 7, 3

queue = collections.deque([i for i in range(1, N+1)] )

# print(list(queue))
joshep = []
while queue :
    for i in range(K-1):
        tmp = queue.popleft()
        queue.append(tmp)
    dead = queue.popleft()
    joshep.append(dead)

print(joshep)

댓글