单链表的实现——Python

给大家分享一段Python单链表实现的方法
本代码主要讲了：
实现链表长度
遍历整个链表
头部添加元素
尾部添加元素
指定位置添加元素
删除节点
查找节点

#单链表的实现
class Node(object):
    """节点"""
    def __init__(self,elem):
        self.elem = elem
        self.next = None

# node = Node()
class SingLeLinkList(object):
    """"单链表"""
    def __init__(self,node = None):
        self.__head = node
    def is_empty(self):
        """链表是否为空"""
        return self.__head == None

    def length(self):
        """"链表的长度"""
        # cur游标用来移动元素
        cur = self.__head
        # count记录数量
        count = 0
        while cur != None:
            count += 1
            cur = cur.next
        return count

    def travel(self):
        """遍历整个链表"""
        cur = self.__head
        while cur != None:
            print(cur.elem,end = " ")
            cur = cur.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:
            cur = self.__head
            while cur.next != None:
                cur = cur.next
            cur.next = node

    def insert(self,pos,item):
        """指定位置添加元素"""
        # pos从0开始
        if pos <= 0:
            self.add(item)
        elif pos > self.length()-1:
            self.append(item)
        else:
            pre = self.__head
            count = 0
            while count <= (pos-1):
                count += 1
                pre = pre.next
        #  当循环退出后，pre只想pos-1处
            node = Node(item)
            node.next = pre.next
            pre.next = node


    def remove(self,item):
        """删除节点"""
        cur = self.__head
        pre = None
        while cur != None:
            if cur.elem == item:
                #判断此节点是否是头节点
                if cur == self.__head:
                    self.__head = cur.next
                else:
                    pre.next = cur.next
                break
            else:
                pre = cur
                cur = cur.next

    def search(self,item):
        """查找节点是否存在"""
        cur = self.__head
        while cur != None:
            if cur.elem == item:
                return True
            else:
                cur = cur.next
        return False






if __name__ == "__main__":
    li = SingLeLinkList()
    print(li.is_empty())
    print(li.length())

    li.append(1)
    print(li.is_empty())
    print(li.length())

    li.append(2)
    li.add(8)
    li.append(3)
    li.append(4)
    li.append(5)
    li.append(6)

    li.insert(-1,9)
    li.travel()

    li.insert(2,100)
    li.travel()

    li.insert(10,200)
    li.travel()

    li.remove(100)
    li.travel()

    li.remove(9)
    li.travel()

    li.remove(200)
    li.travel()

输出结果
True
0
False
1
9 8 1 2 3 4 5 6 
9 8 1 100 2 3 4 5 6 
9 8 1 100 2 3 4 5 6 200 
9 8 1 2 3 4 5 6 200 
8 1 2 3 4 5 6 200 
8 1 2 3 4 5 6 

这就是python单链表的实现