#!/usr/bin/python
#递归实现单链表反转
class ListNode(object):
def __init__(self,x):
self.val=x
self.next=None
def recurse(head,newhead): #递归，head为原链表的头结点，newhead为反转后链表的头结点
if head is None:
return
if head.next is None:
newhead=head
else :
newhead=recurse(head.next,newhead)
head.next.next=head
head.next=None
return newhead
if __name__ == '__main__':
head=ListNode(1) #测试代码
p1=ListNode(2) # 建立链表1->2->3->4->None
p2=ListNode(3)
p3=ListNode(4)
head.next=p1
p1.next=p2
p2.next=p3
newhead=None
p=recurse(head,newhead) #输出链表4->3->2->1->None
while p:
print(p.val)
p=p.next
---------------------
作者：David在学习
来源：CSDN
原文：https://blog.csdn.net/a1032818891/article/details/80683793
版权声明：本文为博主原创文章，转载请附上博文链接！