class MyCircularQueue:
def __init__(self, k: int):
self.queue = [None] * k
self.size = k
self.front = 0
self.rear = 0
def enQueue(self, value: int) -> bool:
if self.queue[self.rear] == None:
self.queue[self.rear] = value
self.rear = (self.rear + 1) % self.size
return True
return False
def deQueue(self) -> bool:
if self.queue[self.front] == None:
return False
self.queue[self.front] = None
self.front = (self.front + 1) % self.size
return True
def Front(self) -> int:
return -1 if self.queue[self.front] == None else self.queue[self.front]
def Rear(self) -> int:
if self.queue[self.rear - 1] == None:
return -1
return self.queue[(self.rear -1) % self.size]
def isEmpty(self) -> bool:
if self.front == self.rear and self.queue[self.front] == None:
return True
return False
def isFull(self) -> bool:
if self.front == self.rear and self.queue[self.front] != None:
return True
return False
문제
https://leetcode.com/problems/design-circular-queue/