-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathqueue_1.py
52 lines (42 loc) · 1.08 KB
/
queue_1.py
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
class Queue:
def __init__(self):
self.items = []
def enqueue(self,item):
"""Add an element to the end of the queue"""
self.item = item
self.items.append(self.item)
def dequeue(self):
"""Remove and return the first item in the queue"""
if len(self.items) != 0:
self.items.pop(-1)
return f"List is empty"
def size(self):
"""Return the number of items in the queue"""
self.count = 0
while self.item != 0:
return len(self.items)
return f"Queue is empty"
def is_empty(self):
"""Check if the queue is empty or not"""
return len(self.items) == 0
def display(self):
"""Print all elements in the queue"""
return self.items
def front(self):
return self.items[-1]
q = Queue()
q.enqueue(10)
q.enqueue(15)
q.enqueue(11)
q.enqueue(100)
q.enqueue(7)
print(q.display())
print(q.front())
print(q.size())
q.dequeue()
q.dequeue()
print(q.display())
q.dequeue()
print(q.display())
print(q.size())
print(q.is_empty())