ADT 单向链表 双端链表 第一次复习

'''
抽象数据类型ADT---属性私有化存储数据，方法操作属性
1.抽象数据类型(ADT)：拥有属性和方法，属性可以存储数据，方法操作属性
'''
'''
class mylist():
    def __init__(self,element):
        self.__element = element
    def delete(self):
        del self.__element
    def set_element(self,element):
        self.__element = element
    def get_element(self):
        return self.__element
ml = mylist([1,4,5,6])
#ml.delete()
print(ml.get_element())
'''

'''
2,零个或多个相同类型数据元素的有限序列
3,链表（删除，插入） 列表（查看）
    属性：data ---存储数据   next ---下一个节点地址
    方法：增删改查
    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 lianbiao():
    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:
                    currentNode = self.__first
                    pre_currentNode = currentNode
                    currentNode = currentNode.get_next()
                    while currentNode.get_next() != None:
                        if currentNode.get_data() == data:
                            pre_currentNode.set_next(currentNode.get_next())
                            break
                        else:
                            pre_currentNode = currentNode
                            currentNode = currentNode.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 = False
                    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 update(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("lhy")
l.insert("lhy","cy")
l.update('lhy','hjx')
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_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 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 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.__first == 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:
            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.insert_first("王五")
a.update_first("王五一")
a.update_last("李思思")
a.update("张三","张毅")
a.delete_first()
a.delete("林徽因")
a.show()