leetcode : Design Circular Queue

https://leetcode.com/problems/design-circular-queue/

Design Circular Queue - LeetCode

 

너무 쉬워서 설명 생략~!

class MyCircularQueue:

    def __init__(self, k: int):
        self.size = k 
        self.queue = [None] * (k + 1)
        self.front = 0
        self.rear = 1
        
    def _inc(self, index):
        return (index + 1) % (self.size + 1)
    
    def _dec(self, index):
        return (index + self.size) % (self.size + 1)

    def enQueue(self, value: int) -> bool:
        if self.isFull():
            return False
        self.queue[self.rear] = value
        self.rear = self._inc(self.rear)
        return True

    def deQueue(self) -> bool:
        if self.isEmpty():
            return False
        self.front = self._inc(self.front)
        return True

    def Front(self) -> int:
        if self.isEmpty():
            return -1
        return self.queue[self._inc(self.front)]

    def Rear(self) -> int:
        if self.isEmpty():
            return -1
        return self.queue[self._dec(self.rear)]

    def isEmpty(self) -> bool:
        return self._inc(self.front) == self.rear

    def isFull(self) -> bool:
        return self.rear == self.front

# Your MyCircularQueue object will be instantiated and called as such:
# obj = MyCircularQueue(k)
# param_1 = obj.enQueue(value)
# param_2 = obj.deQueue()
# param_3 = obj.Front()
# param_4 = obj.Rear()
# param_5 = obj.isEmpty()
# param_6 = obj.isFull()