enqueue
![[자료구조]순열자료구조 Queue 와 Josephus problem](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2F744wB%2FbtrNvybQPm1%2FTtggeSfOtmzVYNUPRAPIJk%2Fimg.png)
[자료구조]순열자료구조 Queue 와 Josephus problem
Queue FIFO First In First Out: 먼저들어온것을 먼저내보내는 자료구조 값을 추가하는것을 enqueue라고 하며 내보내는것을 dequeue라고 합니다. class Queue: def __init__(self): self.items = [] self.first_index = 0 def enqueue(self, value): self.items.append(value) def dequeue(self): if self.first_index == len(self.items): # (1) print('Out of Index') else: result = self.items[self.first_index] self.first_index += 1 return result first_index는 q..