Problem-Solving-Python/solutions/medium/design_circular_deque.py at main · Niteesh57/Problem-Solving-Python · GitHub

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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
class MyCircularDeque:

    def __init__(self, k: int):
        self.data = []
        self.k = k

    def insertFront(self, value: int) -> bool:
        if self.isFull():
            return False
        self.data.insert(0, value)
        return True

    def insertLast(self, value: int) -> bool:
        if self.isFull():
            return False
        self.data.append(value)
        return True


    def deleteFront(self) -> bool:
        if len(self.data) == 0:
            return False
        self.data.pop(0)
        return True


    def deleteLast(self) -> bool:
        if len(self.data) == 0:
            return False
        self.data.pop()
        return True


    def getFront(self) -> int:
        if len(self.data) == 0:
            return -1
        return self.data[0]


    def getRear(self) -> int:
        if len(self.data) == 0:
            return -1
        return self.data[-1]


    def isEmpty(self) -> bool:
        if len(self.data) == 0:
            return True
        return False


    def isFull(self) -> bool:
        if len(self.data) == self.k:
            return True
        return False


# Your MyCircularDeque object will be instantiated and called as such:
# obj = MyCircularDeque(k)
# param_1 = obj.insertFront(value)
# param_2 = obj.insertLast(value)
# param_3 = obj.deleteFront()
# param_4 = obj.deleteLast()
# param_5 = obj.getFront()
# param_6 = obj.getRear()
# param_7 = obj.isEmpty()
# param_8 = obj.isFull()