简而言之就是一些比较复杂的算法不知道怎么写具体过程占位用的
例如:
# 节点类描述
class Node:
def __init__(self, data=None, next=None):
self.data = data
self.next = next
# 单链表类描述
class LinkList:
def __init__(self):
# 构造函数初始化节点
self.head = Node()
def create(self, l, order):
if order:
self.create_tail(l)
else:
self.create_head(l)
def create_tail(self, l):
pass
def create_head(self, l):
pass
def clear(self):
# 将线性表置成空表
self.head.data = None
self.head.next = None
def isEmpty(self):
# 判断是否为空表
return self.head.next is None
def length(self):
# 返回线性表的长度
p = self.head.next
length = 0
while p is not None:
p = p.next
length += 1
return length
def get(self, i):
# 找到i个数据元素
pass
def insert(self, i, x):
pass
def remove(self, i):
pass
def indexOf(self, x):
pass
def display(self):
p = self.head.next
while p is not None:
print(p.data, end='')
p = p.next