forked from lanqiao-courses/python-100
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path023-queue_list.py
More file actions
34 lines (29 loc) · 832 Bytes
/
023-queue_list.py
File metadata and controls
34 lines (29 loc) · 832 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
28
29
30
31
32
33
34
class Node(object):
def __init__(self, data):
self.data = data
self.next = None
class Queue(object):
def __init__(self):
self.head = None
self.tail = None
def enqueue(self, data):
node = Node(data)
# Empty list
if self.head is None and self.tail is None:
self.head = node
self.tail = node
else:
self.tail.next = node
self.tail = node
def dequeue(self):
# Empty list
if self.head is None and self.tail is None:
return None
data = self.head.data
# Remove only element from a one element list
if self.head == self.tail:
self.head = None
self.tail = None
else:
self.head = self.head.next
return data