python remove函数中的单链表

class Node:
    def __init__(self, data):
        self.data = data
        self.next = None

class LinkedList:
    def __init__(self):
        self.head = None
    
    def remove(self, value):
        # 处理链表为空的情况
        if self.head is None:
            return
        
        # 处理删除头节点的情况
        if self.head.data == value:
            self.head = self.head.next
            return
        
        # 遍历链表，找到要删除的节点
        current = self.head
        while current.next is not None:
            if current.next.data == value:
                current.next = current.next.next
                return
            current = current.next
    
    def display(self):
        # 遍历链表并打印节点的值
        current = self.head
        while current is not None:
            print(current.data, end=" -> ")
            current = current.next
        print("None")

# 创建一个单链表的实例
linked_list = LinkedList()

# 添加节点到链表中
linked_list.head = Node(1)
second = Node(2)
third = Node(3)
linked_list.head.next = second
second.next = third

# 打印原始链表
print("原始链表：")
linked_list.display()

# 删除链表中的元素
linked_list.remove(2)

# 打印删除元素后的链表
print("删除元素后的链表：")
linked_list.display()