-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathcircular_queue.py
More file actions
59 lines (37 loc) · 1.22 KB
/
Copy pathcircular_queue.py
File metadata and controls
59 lines (37 loc) · 1.22 KB
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
class MyCircularQueue:
def __init__(self, k: int):
self.capacity = k
self.size = 0
self.data = [0 for _ in range(k)]
self.left, self.right = 0, -1
def enQueue(self, value: int) -> bool:
if self.isFull(): return False
self.right += 1
self.right %= self.capacity
self.data[self.right] = value
self.size += 1
return True
def deQueue(self) -> bool:
if self.isEmpty(): return False
self.left += 1
self.left %= self.capacity
self.size -= 1
return True
def Front(self) -> int:
if self.isEmpty(): return -1
return self.data[self.left]
def Rear(self) -> int:
if self.isEmpty(): return -1
return self.data[self.right]
def isEmpty(self) -> bool:
return self.size == 0
def isFull(self) -> bool:
return self.size == self.capacity
# 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()