Python 实现单链表创建、遍历与节点查找：代码示例详解

```python class Node: def __init__(self, data=None): self.data = data self.next = None class LinkedList: def __init__(self): self.head = None def append(self, data): if not self.head: self.head = Node(data) else: cur = self.head while cur.next: cur = cur.next cur.next = Node(data) def display(self): elems = [] cur_node = self.head while cur_node: elems.append(cur_node.data) cur_node = cur_node.next print(elems) def find(self, data): cur_node = self.head while cur_node: if cur_node.data == data: return True cur_node = cur_node.next return False # 使用 ll = LinkedList() ll.append(1) ll.append(2) ll.append(3) ll.display() # 输出：[1, 2, 3] print(ll.find(2)) # 输出：True print(ll.find(4)) # 输出：False ``` ######[AI写代码神器 | 320点数解答 | 2024-06-21 21:31:04]