python 链表的反转

code

#!/usr/bin/python
# -*- coding: utf- -*-

class ListNode:
  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

head=ListNode()      #测试代码
p1=ListNode()     # 建立链表1->->->->None
p2=ListNode()
p3=ListNode()

head.next=p1
p1.next=p2
p2.next=p3
newhead=None

p=recurse(head,newhead)    #输出链表4->->->->None 

while p:
  print p.val
  p=p.next

输出

参考：
https://www.jb51.net/article/134706.htm