链表的增删改查代码示范
时间: 2024-05-02 18:15:26 浏览: 15
链表是一种常见的数据结构,它由一系列节点组成,每个节点包含一个数据元素和一个指向下一个节点的指针。下面是链表的增删改查的代码示范:
1. 链表的创建和添加节点[^1]:
```python
class Node:
def __init__(self, data=None):
self.data = data
self.next = None
class LinkedList:
def __init__(self):
self.head = None
def add_node(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
```
2. 链表的删除节点:
```python
class LinkedList:
# ...
def delete_node(self, data):
if self.head is None:
return
if self.head.data == data:
self.head = self.head.next
return
current = self.head
while current.next:
if current.next.data == data:
current.next = current.next.next
return
current = current.next
```
3. 链表的修改节点:
```python
class LinkedList:
# ...
def update_node(self, old_data, new_data):
current = self.head
while current:
if current.data == old_data:
current.data = new_data
return
current = current.next
```
4. 链表的查找节点:
```python
class LinkedList:
# ...
def search_node(self, data):
current = self.head
while current:
if current.data == data:
return True
current = current.next
return False
```