forked from nryoung/algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathqueue.py
More file actions
30 lines (24 loc) · 700 Bytes
/
Copy pathqueue.py
File metadata and controls
30 lines (24 loc) · 700 Bytes
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
"""
Queue data structure implemented:
--------------------------------
add : add element at last
remove : remove element from front
return value
is_empty : 1 value returned on empty
0 value returned on not empty
size : return size of queue
Time Complexity: O(1)
"""
from collections import deque
class queue :
queue_list = deque([])
def __init__(self):
self.queue_list = deque([])
def add(self,value):
self.queue_list.append(value)
def remove(self):
return self.queue_list.popleft()
def is_empty(self):
return not len(self.queue_list)
def size(self):
return len(self.queue_list)