leetcode622设计循环队列

题解-数组

class MyCircularQueue:

    def __init__(self, k: int):
        """
        Initialize your data structure here. Set the size of the queue to be k.
        """
        self.myqueue=[0]*k
        self.my_count=0
        self.head_index=0
        self.capcity=k
        

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


        

    def deQueue(self) -> bool:
        """
        Delete an element from the circular queue. Return true if the operation is successful.
        """
        if self.my_count==0:
            return False
        else:
            self.head_index+=1
            self.my_count-=1
            return True
        

    def Front(self) -> int:
        """
        Get the front item from the queue.
        """
        if self.my_count==0:
            return -1
        else:

            return self.myqueue[self.head_index]
        

    def Rear(self) -> int:
        """
        Get the last item from the queue.
        """
        if self.my_count==0:
            return -1
        else:
            return self.myqueue[(self.head_index+self.my_count-1)%self.capcity]

        

    def isEmpty(self) -> bool:
        """
        Checks whether the circular queue is empty or not.
        """
        if self.my_count==0:
            return True
        else:
            return False
        

    def isFull(self) -> bool:
        """
        Checks whether the circular queue is full or not.
        """
        if self.my_count==self.capcity:
            return True
        else:
            return False

        


# 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()