LEETCODE 622. 设计循环队列

class MyCircularQueue:

    def __init__(self, k: int):
        self.size=k+1
        self.rear=0
        self.front=0
        self.queue=[None for _ in range(k+1)]

    def enQueue(self, value: int) -> bool:
        if self.front==(self.rear+1)%self.size:
            return False
        self.rear=(self.rear+1)% self.size
        self.queue[self.rear]=value

        return True


    def deQueue(self) -> bool:
        if self.front==self.rear:
            return False
        self.queue[self.front]=None 
        self.front=(self.front+1)% self.size
        return True

    def Front(self) -> int:
        if self.front==self.rear:
            return -1
        return self.queue[(self.front+1)%self.size]

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

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


    def isFull(self) -> bool:
        if self.front==(self.rear+1)%self.size:
            return True
        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()
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54