Leetcode设计循环队列

设计循环队列

class MyCircularQueue:

    def __init__(self, k: int):
        """
        Initialize your data structure here. Set the size of the queue to be k.
        """
        self.len = k
        self.values = [-1] * self.len
        self.front = 0
        self.num = 0

    def enQueue(self, value: int) -> bool:
        """
        Insert an element into the circular queue. Return true if the operation is successful.
        """
        if self.num == self.len:
            return False
        self.values[(self.front + self.num) % self.len] = value
        self.num += 1
        return True

    def deQueue(self) -> bool:
        """
        Delete an element from the circular queue. Return true if the operation is successful.
        """
        if self.num == 0:
            return False
        self.values[self.front] = -1
        self.front = (self.front + 1) % self.len
        self.num -= 1
        return True

    def Front(self) -> int:
        """
        Get the front item from the queue.
        """
        return self.values[self.front]

    def Rear(self) -> int:
        """
        Get the last item from the queue.
        """
        return self.values[(self.front + self.num - 1) % self.len]

    def isEmpty(self) -> bool:
        """
        Checks whether the circular queue is empty or not.
        """
        return self.num == 0

    def isFull(self) -> bool:
        """
        Checks whether the circular queue is full or not.
        """
        return self.num == self.len