Design Circular Deque LeetCode solution in Python

1
class MyCircularDeque:
2
    def __init__(self, k: int):
3
        self.queue = [None] * k
4
        self.max_size = k
5
        self.head = 0
6
        self.tail = 0
7
        self.size = 0
8

9
    def insertFront(self, value: int) -> bool:
10
        if self.isFull():
11
            return False
12
        self.head = (self.head - 1) % self.max_size
13
        self.queue[self.head] = value
14
        self.size += 1
15
        return True
16

17
    def insertLast(self, value: int) -> bool:
18
        if self.isFull():
19
            return False
20
        self.queue[self.tail] = value
21
        self.tail = (self.tail + 1) % self.max_size
22
        self.size += 1
23
        return True
24

25
    def deleteFront(self) -> bool:
26
        if self.isEmpty():
27
            return False
28
        self.head = (self.head + 1) % self.max_size
29
        self.size -= 1
30
        return True
31

32
    def deleteLast(self) -> bool:
33
        if self.isEmpty():
34
            return False
35
        self.tail = (self.tail - 1) % self.max_size
36
        self.size -= 1
37
        return True
38

39
    def getFront(self) -> int:
40
        if self.isEmpty():
41
            return -1
42
        return self.queue[self.head]
43

44
    def getRear(self) -> int:
45
        if self.isEmpty():
46
            return -1
47
        return self.queue[(self.tail - 1) % self.max_size]
48

49
    def isEmpty(self) -> bool:
50
        return self.size == 0
51

52
    def isFull(self) -> bool:
53
        return self.size == self.max_size