-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathqueue_array.py
More file actions
55 lines (41 loc) · 1.23 KB
/
Copy pathqueue_array.py
File metadata and controls
55 lines (41 loc) · 1.23 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
###############################################################
# simple queue implementation using []
# methods implemented :
# enqueue (offer), dequeue(poll), peek, isFull, isEmpty
###############################################################
class QueueWithArray:
def __init__(self, size):
self.max_size = size
self.size = 0
self.data = []
def isEmpty(self) -> bool:
return self.size == 0
def isFull(self) -> bool:
return self.size == self.max_size
def enqueue(self, val) -> bool:
if self.isFull():
print("queue is full")
return False
self.data.insert(0, val)
self.size = self.size + 1
return True
def dequeue(self):
if self.isEmpty():
print("queue is empty")
return -1
val = self.data.pop()
self.size = self.size - 1
return val
def peek(self):
return self.data[self.size - 1]
def print(self) -> None:
if self.isEmpty():
print("queue is empty")
return
out = ""
i = self.size - 1
while i > -1:
out = out + " " + str(self.data[i])
i = i - 1
print(out)
return