Python0125-10（数据结构+链表）

1.抽象数据类型（ADT）：拥有属性和方法，属性可以存储数据（完全私有），方法可以操作属性
2.线性表
3.链表（删除插入） 列表（查看）
属性：data——存储数据， next——下一个节点的地址
方法：增删改查
next:后继
pre：前驱

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 first_linked_last():
    def __init__(self,first=None,last=None):
        self.__first = first
        self.__last = last

    def insert_first(self, data):
        n = node(data)
        if self.__first == None:
            self.__first = n
            self.__last = n
        else:
            n.set_next(self.__first)
            self.__first = n

    def insert_last(self, data):
        n = node(data)
        if self.__first == None:
            self.__first = n
            self.__last = n
        else:
            self.__last.set_next(n)
            self.__last = n
    def insert(self,data0,data):
        n = node(data)
        if self.__first == None:
            self.__first= n
            self.__last=n
        else:
            currentNode = self.__first
            flag = False
            while currentNode.get_next() != None:
                if currentNode.get_data()==data0:
                    flag=True
                    break
                else:
                    currentNode = currentNode.get_next()
            if flag:
                n.set_next(currentNode.get_next())
                currentNode.set_next(n)
            else:
                if currentNode.get_data() == data0:
                    self.insert_last(data)



    def delete_first(self):
        if self.__first == None:
            print("空链表无法删除")
        else:
            self.__first=self.__first.get_next()
    def delete(self,data):
        if self.__first == None:
            print("空链表无法删除")
        else:
            currentNode = self.__first
            pre_currentNode = self.__first
            flag = False
            while currentNode.get_next != None:
                if currentNode.get_data() == data:
                    flag = True
                    break
                else:
                    pre_currentNode=currentNode
                    currentNode = currentNode.get_next()
            if flag:
                if currentNode == pre_currentNode:
                    self.delete_first()
                else:
                    pre_currentNode.set_next(currentNode.get_next())
            else:
                if currentNode.get_data == data:
                    pre_currentNode.set_next(None)
                    self.__last = pre_currentNode

    def update_first(self,data):
        if self.__first == None:
            print("空链表无法修改")
        else:
            self.__first.set_data(data)
    def update_last(self, data):
        if self.__last == None:
            print("空链表无法修改")
        else:
            self.__last.set_data(data)

    def update(self,data0,data):
        if self.__first == None:
            print("空链表无法修改")
        else:
            currentNode = self.__first
            flag = False
            while currentNode.get_next != None:
                if currentNode.get_data()== data0:
                    flag= True
                    break
                else:
                    currentNode= currentNode.get_next()
            if flag:
                currentNode.set_data(data)
            else:
                self.update_last(data)
    def show(self):
        if self.__first ==None:
            print("该链表为空")
        else:
            curreentNode = self.__first
            while curreentNode != None:
                print(curreentNode.get_data())
                curreentNode=curreentNode.get_next()

a = first_linked_last()
a.insert_first("张三")
a.insert_last("李四")
a.insert("张三","李宏宇")
a.insert_first("王五")
a.update_first("王五一")
a.update_last("李四四")
a.update("张三","张一")
a.delete_first()
a.delete("李宏宇")
a.show()