用于插入和移除链表后面的节点的方法

# 定义链表节点类
class Node:
    def __init__(self, data):
        self.data = data
        self.next = None

# 定义链表类
class LinkedList:
    def __init__(self):
        self.head = None

    # 插入节点
    def insert(self, data):
        new_node = Node(data)
        if self.head is None:
            self.head = new_node
        else:
            current = self.head
            while current.next:
                current = current.next
            current.next = new_node

    # 移除节点
    def remove(self):
        if self.head is None:
            return
        elif self.head.next is None:
            self.head = None
        else:
            current = self.head
            while current.next.next:
                current = current.next
            current.next = None

# 创建链表对象
linked_list = LinkedList()

# 插入节点
linked_list.insert(1)
linked_list.insert(2)
linked_list.insert(3)

# 移除节点
linked_list.remove()