python请编程在顺序链表中实现以下功能: 对链表头节点、链表中间节点,表尾节点插入一个新元素; 对链表头节点、链表中间节点,表尾节点删除对应元素; 查找表中指定值的节点; 要求操作前后均输出这列数和表的长度,编程中输入输出有必要的提示,养成好的注释习惯。
时间: 2024-05-08 15:20:01 浏览: 5
您好!感谢您对ChitGPT的使用和信任。关于您的问题,以下是python顺序链表实现的代码:
```python
# 定义链表节点类
class Node:
def __init__(self, data=None):
self.data = data
self.next = None
# 定义链表类
class LinkedList:
def __init__(self):
self.head = None
self.length = 0
# 在表头插入元素
def insert_at_head(self, data):
new_node = Node(data)
new_node.next = self.head
self.head = new_node
self.length += 1
print("插入元素{}成功,表长为{}".format(data, self.length))
# 在中间插入元素
def insert_at_mid(self, pos, data):
if pos <= 0:
self.insert_at_head(data)
elif pos >= self.length:
self.insert_at_end(data)
else:
new_node = Node(data)
p = self.head
count = 0
while count < pos-1:
p = p.next
count += 1
new_node.next = p.next
p.next = new_node
self.length += 1
print("插入元素{}成功,表长为{}".format(data, self.length))
# 在表尾插入元素
def insert_at_end(self, data):
new_node = Node(data)
if not self.head:
self.head = new_node
else:
p = self.head
while p.next:
p = p.next
p.next = new_node
self.length += 1
print("插入元素{}成功,表长为{}".format(data, self.length))
# 删除表头元素
def remove_at_head(self):
if not self.head:
print("删除失败,链表为空")
return None
else:
data = self.head.data
self.head = self.head.next
self.length -= 1
print("删除元素{}成功,表长为{}".format(data, self.length))
return data
# 删除中间元素
def remove_at_mid(self, pos):
if pos <= 0:
self.remove_at_head()
elif pos >= self.length - 1:
self.remove_at_end()
else:
p = self.head
q = None
count = 0
while count < pos:
q = p
p = p.next
count += 1
data = p.data
q.next = p.next
self.length -= 1
print("删除元素{}成功,表长为{}".format(data, self.length))
return data
# 删除表尾元素
def remove_at_end(self):
if not self.head:
print("删除失败,链表为空")
return None
else:
p = self.head
q = None
while p.next:
q = p
p = p.next
if not q:
self.head = None
else:
q.next = None
data = p.data
self.length -= 1
print("删除元素{}成功,表长为{}".format(data, self.length))
return data
# 查找指定值的节点
def find(self, data):
p = self.head
pos = 0
while p:
if p.data == data:
print("元素{}在表中的位置为{}".format(data, pos))
return pos
p = p.next
pos += 1
print("元素{}不在表中".format(data))
return -1
# 打印链表
def display(self):
p = self.head
while p:
print(p.data, end=' ')
p = p.next
print('')
# 测试代码
if __name__ == '__main__':
# 创建链表
linkedlist = LinkedList()
# 测试插入元素
linkedlist.insert_at_head(1)
linkedlist.insert_at_head(2)
linkedlist.insert_at_end(3)
linkedlist.insert_at_mid(1, 4)
linkedlist.insert_at_mid(2, 5)
# 打印链表
linkedlist.display()
# 测试查找元素
linkedlist.find(4)
linkedlist.find(6)
# 测试删除元素
linkedlist.remove_at_head()
linkedlist.remove_at_mid(2)
linkedlist.remove_at_end()
# 打印链表
linkedlist.display()
```
以上就是python顺序链表实现的完整代码,希望能够回答到您的问题,如有其他疑问,请随时与我交流。