-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path622_Design_Circular_Queue.py
More file actions
44 lines (34 loc) · 1.02 KB
/
622_Design_Circular_Queue.py
File metadata and controls
44 lines (34 loc) · 1.02 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
class MyCircularQueue:
def __init__(self, k: int):
self.size = k
self.queue = []
def enQueue(self, value: int) -> bool:
if len(self.queue) == self.size:
return False
self.queue.append(value)
return True
def deQueue(self) -> bool:
if not self.queue:
return False
self.queue.pop(0)
return True
def Front(self) -> int:
if not self.queue:
return -1
return self.queue[0]
def Rear(self) -> int:
if not self.queue:
return -1
return self.queue[len(self.queue) - 1]
def isEmpty(self) -> bool:
return len(self.queue) == 0
def isFull(self) -> bool:
return len(self.queue) == self.size
# 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()