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)
'leetcode 풀이 > 큐, 스택 (Array)' 카테고리의 다른 글
boj-7785. 회사에있는사람 (0) | 2023.01.20 |
---|---|
boj-2164. 카드 2 (0) | 2023.01.19 |
leetcode 46. Permutations 순열 (0) | 2022.04.03 |
leetcode 153 - Find Minimum in Rotated Sorted Array (0) | 2022.03.28 |
leetcode 152 - Maximum Product Subarray (0) | 2022.03.28 |
댓글