算法-单链表

# @ Time : 2020/10/27 16:31
# @ Author : Ellen


class SingleNode(object):
    """单链表的节点"""

    def __init__(self, item):
        # item存放数据
        self.item = item
        # next是下一个节点的标识
        self.next = None


class SingleLinkList(object):
    """单链表"""
    '''
    .is_empty()链表是否 为空
    .length() 链表长度
    .travel() 遍历整个链表
    .append(item) 链表尾部添加元素
    .add(item) 链表头部添加元素
    .insert(pos, item) 指定位置添加元素
    .search(item) 查找节点是否存在
    .remove(item) 删除节点
    '''

    def __init__(self, node=None):
        # if node:
        #     self.__head = node
        # else:
        #     self.__head = None
        # 空链表  self.__head = None
        # 非空链表 self.__head = node
        self.__head = node

    def is_empty(self):
        """链表是否为空"""
        if self.__head == None:
            return True
        else:
            return False

    def length(self):
        """链表长度"""
        # cur游标 用来遍历链表
        cur = self.__head
        # 计数
        count = 0
        # 尾结点为指向None 停止循环
        while cur != None:
            count += 1
            # 指针向后移动
            cur = cur.next
        return count

    def travel(self):
        """遍历整个链表"""
        cur = self.__head
        while cur != None:
            print(cur.item, end=' ')
            cur = cur.next

    def append(self, item):
        """链表尾部添加元素"""
        node = SingleNode(item)

        # 空链表
        if self.is_empty():
            self.__head = node
        else:
            # 非空链表
            cur = self.__head
            while cur.next != None:
                cur = cur.next
            cur.next = node

    def add(self, item):
        """链表头部添加元素"""
        node = SingleNode(item)
        node.next = self.__head
        self.__head = node

    def insert(self, pos, item):
        """指定位置添加元素"""
        if pos <= 0:
            self.add(item)
        elif pos > (self.length() - 1):
            self.append(item)
        else:
            node = SingleNode(item)
            pre = self.__head
            count = 0
            while count < (pos - 1):
                count += 1
                pre = pre.next

            node.next = pre.next
            pre.next = node

    def search(self, item):
        """查找节点是否存在"""
        cur = self.__head
        # 循环结束 代表指针指向最后一个节点
        while cur != None:
            if cur.item == item:
                return True
            else:
                cur = cur.next
        return False

    def remove(self, item):
        """删除节点"""

        cur = self.__head
        pre = None

        while cur != None:
            # 找到指定的元素
            if cur.item == item:
                if cur == self.__head:
                    self.__head = cur.next
                else:
                    pre.next = cur.next
                break
            else:
                # 继续移动指针
                pre = cur
                cur = cur.next


if __name__ == '__main__':
    node = SingleNode(200)
    sll = SingleLinkList()
    sll.append(30)
    sll.append(40)
    sll.add(1)
    sll.add(2)
    sll.insert(2, 66)
    print(sll.search(30))
    sll.remove(40)
    res = sll.travel()

执行结果：
True
2 1 66 30