'''
ADT(抽象数据类型):拥有属性和方法,属性可以存储数据,方法可以操作属性
2.线性表概念
3.链表(删除 插入) 列表(查看)
属性:date --存储数据 next---下一个节点的地址
方法:增删改查
'''
'''
class node():
def __init__(self,data=None,next=None):
self.__data= data
self.__next = next
def get_data(self):
return self.__data
def set_data(self,data):
self.__data = data
def get_next(self):
return self.__next
def set_next(self,next):
self.__next = next
class lb():
def __init__(self,first):
self.__first = first
def delete(self,data):
if self.__first != None:
if self.__first.get_next!=None:
if self.__first.get_data()==data:
self.__first = self.__first.get_next()
else:
crrentNode = self.__first
pre_crrentNode =crrentNode
crrentNode = crrentNode.get_next()
while crrentNode.get_next()!=None:
if crrentNode.get_data()==data:
pre_crrentNode.set_next(crrentNode.get_next())
break
else:
pre_crrentNode = crrentNode
crrentNode = crrentNode.get_next()
else:
if self.__first.get_data() == data:
self.__first = None
else:
print("空链表不允许删除")
def append(self,data):
n = node(data)
if self.__first==None:
self.__first = n
else:
currentNode = self.__first
while currentNode.get_next()!=None:
currentNode = currentNode.get_next()
currentNode.set_next(n)
def insert(self, data1, data2):
if self.__first == None:
print("空链表,没办法插入")
else:
currentNode = self.__first
flag = False
while currentNode.get_next() != None:
if currentNode.get_data() == data1:
flag = True
break
else:
currentNode = currentNode.get_next()
if flag:
n = node(data2, currentNode.get_next())
currentNode.set_next(n)
else:
if currentNode.get_data() == data1:
currentNode.set_next(node(data2))
def showInfo(self):
if self.__first == None:
print("该链表为空")
else:
currentNode = self.__first
while currentNode.get_next() != None:
ADT 线性表概念 链表
最新推荐文章于 2022-05-19 01:25:35 发布