Repository navigation
Expand file tree
/
Copy pathcircle_queue.py
More file actions
91 lines (76 loc) · 2.19 KB
/
Copy pathcircle_queue.py
File metadata and controls
91 lines (76 loc) · 2.19 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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
# coding=utf-8
# builtins
# third party package
# self built
class MyCircularQueue:
def __init__(self, k: int):
"""
Initialize your data structure here. Set the size of the queue to be k.
"""
self.data = [None for _ in range(k)]
self.head = None
self.tail = None
self.size = k
def enQueue(self, value: int) -> bool:
"""
Insert an element into the circular queue. Return true if the operation is successful.
"""
if self.isFull():
return False
if self.head is None:
self.head = 0
self.tail = -1
self.tail = (self.tail + 1) % self.size
self.data[self.tail] = value
# print(self.data, self.tail, "++++")
return True
def deQueue(self) -> bool:
"""
Delete an element from the circular queue. Return true if the operation is successful.
"""
if self.isEmpty():
return False
self.data[self.head] = None
self.head = (self.head + 1) % self.size
return True
def Front(self) -> int:
"""
Get the front item from the queue.
"""
return self.data[self.head] if not self.isEmpty() else -1
def Rear(self) -> int:
"""
Get the last item from the queue.
"""
return self.data[self.tail] if not self.isEmpty() else -1
def isEmpty(self) -> bool:
"""
Checks whether the circular queue is empty or not.
"""
for i in self.data:
if i is not None:
return False
else:
return True
def isFull(self) -> bool:
"""
Checks whether the circular queue is full or not.
"""
for i in self.data:
if i is None:
return False
else:
return True
if __name__ == "__main__":
queue = MyCircularQueue(6)
print(queue.enQueue(6))
print(queue.Rear())
print(queue.Rear())
print(queue.deQueue())
print(queue.enQueue(5))
print(queue.Rear())
print(queue.deQueue())
print(queue.Front())
print(queue.deQueue())
print(queue.deQueue())
print(queue.deQueue())