-
Notifications
You must be signed in to change notification settings - Fork 0
/
listqueue.py
48 lines (37 loc) · 1018 Bytes
/
listqueue.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
from liststack import ListStack
__all__ = ['ListQueue']
class ListQueue():
def __init__(self):
self.list = list()
# 入队
def enqueue(self, elem):
self.list.append(elem)
# 出队
def dequeue(self):
try:
rst = self.list.pop(0)
except IndexError:
raise IndexError("dequeue from empty queue")
return rst
def gethead(self):
try:
rst = self.list[0]
except IndexError:
raise IndexError("dequeue from empty queue")
return rst
def isempty(self):
return bool(self.list)
def reverse(self):
stack = ListStack()
while not isempty(self):
stack.push(self.dequeue())
while not isempyt(stack):
self.enqueue(stack.pop())
def __iter__(self):
return self
def __next__(self):
try:
rst = self.gethead()
except IndexError:
raise StopIteration()
return rst