Python在类中实现链表

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

class LinkedList:
    def __init__(self):
        self.head = None

    def append(self, data):
        new_node = Node(data)
        if not self.head:
            self.head = new_node
            return
        last_node = self.head
        while last_node.next:
            last_node = last_node.next
        last_node.next = new_node

    def print_list(self):
        current_node = self.head
        while current_node:
            print(current_node.data, end=" -> ")
            current_node = current_node.next
        print("None")

# 示例使用
llist = LinkedList()
llist.append(1)
llist.append(2)
llist.append(3)
llist.print_list()  # 输出: 1 -> 2 -> 3 -> None

def print_list(self):
    if not self.head:
        print("List is empty")
        return
    current_node = self.head
    while current_node:
        print(current_node.data, end=" -> ")
        current_node = current_node.next
    print("None")

def delete_node(self, key):
    current_node = self.head
    previous_node = None
    while current_node and current_node.data != key:
        previous_node = current_node
        current_node = current_node.next
    if not current_node:
        return
    if previous_node:
        previous_node.next = current_node.next
    else:
        self.head = current_node.next