data_struct/ChainQueue.py at master · strayberry/data_struct · GitHub

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
# -*- coding: UTF-8

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 is_empty(self):
		if self.head is None:
			print('This is an empty queue')
		else:
			print('This is not an empty queue')

	def enqueue(self, data):
		node = Node(data)
		if self.head is None:
			self.head = node
			self.tail = node
		else:
			self.tail.next = node
			self.tail = node

	def dequeue(self):
		if self.head is None:
			print('This is an empty queue')
			return
		cur = self.head
		self.head = cur.next
		return cur.data

	def iter(self):
		if self.head is None:
			print('This is an empty queue')
			return
		while self.head is not None:
			print(self.dequeue())


if __name__ == '__main__':
	queue = Queue()
	queue.is_empty()
	queue.enqueue(1)
	queue.is_empty()
	print(queue.dequeue())
	queue.is_empty()
	queue.enqueue(1)
	queue.enqueue(2)
	queue.enqueue(3)
	queue.iter()