一、队列的定义
一种先进先出的容器
二、队列的顺序表实现
class SequenceQueue:
def __init__(self):
self.members = list()
def is_empty(self):
if not len(self.members):
return False
else:
return True
def show(self):
if self.is_empty():
print("队列为空")
return False
for elem in self.members:
print(elem)
def inside(self, val):
self.members.insert(0, val)
def ouside(self):
self.members.pop()
三、队列的链表实现
class Node:
def __init__(self, data):
self.data = data
self.next = None
class LinkQueue:
def __init__(self):
self.head = None
def inside(self, data):
node = Node(data)
self.next = self.head
self.head = node
def ouside(self):
cur = self.head
prev = None
while cur:
prev = cur
cur = cur.next
prev.next = cur.next
1919
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
