输入:第三个节点p, (1->2->3->4->5->6)
输出: 1->2->3->4->5->6
1. 如果p节点是尾结点,则无法通过p直接删除
2. 如果不是,可以把p.next节点的值赋值给p,然后删除p.next节点即可。
代码
from DataStructure.LinkedList import LinkedList, Node
import sys
def removeP(p):
if p is None or p.next is None:
return False
p.data = p.next.data
tmp = p.next
p.next = tmp.next
return True
link = LinkedList()
link.add(1)
link.add(2)
link.add(3)
link.add(4)
link.add(5)
link.add(6)
cur = link.head
while cur:
value = str(cur.data) + "->"
sys.stdout.write(value)
cur = cur.next
print()
print("========remove node 3======")
p = link.head.next.next
removeP(p)
cur2 = link.head
while cur2:
value = str(cur2.data) + "->"
sys.stdout.write(value)
cur2 = cur2.next
# 结果
1->2->3->4->5->6->
========remove node 3======
1->2->4->5->6->