python实现单链表

class Node(object):
    # 结点类
    def __init__(self, item):
        self.item = item
        self.next = None


class SingleLinklist(object):
    # 单链表
    def __init__(self, node=None):
        self.__head = node

    def is_empty(self):
        # 链表是否为空,如果为空，则返回真
        return self.__head is None  #

    def length(self):
        # 链表长度
        cur = self.__head  # 设置一个辅助变量游标cur
        count = 0
        while cur is not None:
            count += 1
            cur = cur.next
        return count

    def trave(self):
        # 遍历整个列表
        cur = self.__head  # 设置一个辅助变量游标cur
        while cur is not None:
            print(cur.item, end=" ")
            cur = cur.next
        print("")  # 输出换行

    def add(self, item):
        # 链表头部添加元素，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:
            cur = self.__head
            while cur.next is not None:
                cur = cur.next
                # 退出循环时，cur指向的是尾接点

    def insert(self, pos, item):
        # 链表指定位置插入元素
        # 在头部添加元素
        if pos <= 0:
            self.add(item)
        elif pos >= self.length():
            self.append(item)
        else:
            cur = self.__head
            count = 0
            while count < (pos - 1):
                count += 1
                cur = cur.next
                # 退出循环时，cur指向pos的前一个位置
            node = Node(item)
            node.next = cur.next
            cur.next = node

    def remove(self, item):
        # 删除节点
        cur = self.__head
        pre = None
        while cur is not None:
            # 找到要删除的元素
            if cur.item == item:
                # 在头部找到了元素
                if cur == self.__head:
                    self.__head = cur.next
                else:
                    pre.next = cur.next
                return
            # 不是要找的元素， 移动游标
            pre = cur
            cur = cur.next

    def search(self, item):
        # 查找节点是否存在
        cur = self.__head
        while cur is not None:
            if cur.item == item:
                return True
            cur = cur.next
            return False


if __name__ == '__main__':
    l1 = SingleLinklist()  # 单链表l1
    print(l1.length())
    l1.trave()

    l1.append(1)  # 1
    l1.trave()

    l1.append(2)  # 1,2
    l1.trave()

    l1.add(3)  # 3,1,2
    l1.trave()

    l1.insert(0, 4)  # 4,3,1,2
    l1.trave()

    l1.insert(18, 5)  # 5,4,3,1,2
    l1.trave()

    l1.insert(2, 6)  # 6,5,4,3,1,2
    l1.trave()

    l1.remove(4)  # 3,6,1,2,5
    l1.trave()

    l1.remove(5)  # 3,6,1,2
    l1.trave()

    l1.remove(6)  # 3,1,2
    l1.trave()

    l1.remove(3)  # 1,2
    l1.trave()

    l1.remove(2)  # 1
    l1.trave()

    l1.remove(1)  #
    l1.trave()

输出结果：