2021-09-02 python实现单链表

# 节点类
class Node:
    def __init__(self,element):
        self.element = element
        self.next = None

# 单链表类
class SingleLinklist:
    # 初始化链表为空
    def __init__(self,node=None):
        self.head = node
        return None
    # 判断链表是否为空
    def is_empty(self):
        if self.head == None:
            return True
        else:
            return False
    # 获取链表长度
    def get_length(self):
        length = 0
        current = self.head
        while current != None:
            length += 1
            current = current.next
        return length
    # 遍历链表
    def travel(self):
        current = self.head
        while current != None:
            print(current.element,end=' ')
            current = current.next
        print()
    # 从链表头部添加节点
    def add(self,item):
        node = Node(item)
        node.next = self.head
        self.head = node
    # 从链表尾部添加节点
    def append(self,item):
        node = Node(item)
        if self.is_empty():
            self.head = node
        else:
            current = self.head
            while current.next != None:
                current = current.next
            current.next = node
    # 从链表中间插入节点
    def insert(self,pos,item):
        current = self.head
        if pos <= 0:
            self.add(item)
        elif pos > self.get_length():
            self.append(item)
        else:
            for i in range(1,pos-1):
                current = current.next
            node = Node(item)
            node.next = current.next
            current.next = node

    # 从链表中删除节点
    def remove(self,item):
        current = self.head
        pre = None
        while current != None:
            if current.element == item:
                if current == self.head:
                    self.head = current.next
                else:
                    pre.next = current.next
                    break
            else:
                pre = current
                current = current.next
    # 从链表中搜索某个节点,返回该节点的位置
    def search(self,item):
        current = self.head
        for i in range(1,self.get_length()+1):
            if current.element == item:
                return i
            else:
                current = current.next
        return 'None'

if __name__ == '__main__':
    sl = SingleLinklist()
    #print(sl.is_empty())
    #print(sl.get_length())
    sl.add(1)
    sl.append(2)
    sl.append(3)
    sl.append(4)
    sl.append(6)
    sl.travel()
    sl.insert(5,5)
    sl.travel()
    sl.remove(6)
    sl.travel()
    print(sl.search(5))

运行结果：