在编程中，单链表是一种常见的数据结构，每个节点包含两个部分：数据和指向下一个节点的指针。下面是单链表的一些基本操作的实现： ### 初始化（构造函数） ```python class Node: def __init__(self, data=None): self.data = data self.next = None # 初始时指针为空 class LinkedList: def __init__(self): self.head = None ``` ### 创建新节点并插入 - `append`: 在链表末尾添加节点 ```python def append(self, data): new_node = Node(data) if not self.head: self.head = new_node else: current = self.head while current.next: current = current.next current.next = new_node ``` - `insert_at_position`: 在指定位置插入节点 ```python def insert_at_position(self, data, position): new_node = Node(data) if position == 0: new_node.next = self.head self.head = new_node else: current = self.head for _ in range(position - 1): if current.next is None: break current = current.next new_node.next = current.next current.next = new_node ``` ### 查找 - `search`: 查找特定值的节点 ```python def search(self, target): current = self.head while current and current.data != target: current = current.next return current is not None ``` ### 删除 - `delete`: 删除匹配的节点（根据值或位置） ```python def delete_by_value(self, value): if self.head is None or self.head.data == value: self.head = self.head.next else: current = self.head while current.next and current.next.data != value: current = current.next if current.next: current.next = current.next.next def delete_at_position(self, position): if position == 0: if self.head: self.head = self.head.next else: raise IndexError("Position out of bounds") else: current = self.head for _ in range(position - 1): if not current.next: break current = current.next if current.next: current.next = current.next.next else: raise IndexError("Position out of bounds") ``` ### 输出链表 - `print_list`: 打印链表内容 ```python def print_list(self): current = self.head while current: print(current.data, end=" -> ") current = current.next print("None") ```