Python实现链表数据结构

每日一记

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 lianbiao():
    def __init__(self,first):
        self.__first = first
    def delete(self, data):
        pass     
               
    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:
                print(currentNode.get_data())
                currentNode = currentNode.get_next()
            print(currentNode.get_data())
    def updata(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:
                currentNode.set_data(data2)
            else:
                if currentNode.get_data() == data1:
                    currentNode.set_data(data2)

l = lianbiao(None)
l.append("张三")
l.append("李四")
l.insert("张三","王五")
l.showInfo()

#双端链表
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() == data:
                    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
            precurrentnode = self.__first
            flag = False
            while currentnode.get_next() !=None:
                if currentnode.get_data() == data:
                    flag = True
                    break
                else:
                    precurrentnode = currentnode
                    currentnode = currentnode.get_next()
            if flag:
                if currentnode == precurrentnode:
                    self.delete_first()
                else:
                    precurrentnode.set_next(currentnode.get_next())
            else:
                if currentnode.get_data() == data:
                    precurrentnode.set_next(None)
                    self.__last = precurrentnode
    def updata_first(self,data):
        if self.__first == None:
            print("空链表，不能修改")
        else:
            self.__first.set_data(data)
    def updata_last(self,data):
        if self.__first == None:
            print("空链表，不能修改")
        else:
            self.__last.set_data(data)
    def updata(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.updata_last(data)

    def show(self):
        if self.__first ==None:
            print("该列表为空")
        else:
            currentnode = self.__first
            while currentnode != None:
                print(currentnode.get_data())
                currentnode = currentnode.get_next()
a = first_Linked_last()
a.insert_first("张三")
a.insert_last("李四")
a.insert("张三","刘二")
a.updata_first("张大")
a.updata_last("李武")
a.updata("刘二","王五")
a.delete_first()
a.delete("李武")
a.delete_first()
a.show()