单链表的反转

# 单链表的一个节点
class ListNode(object):
    def __init__(self,x):
        self.val = x
        self.next = None

def reverse_link_list(head ,newhead):
   """递归，head为原链表的头结点，newhead为反转后链表的头结点"""
   if head is None:
       return
   if head.next is None:
       newhead=head
   else:
       newhead=reverse_link_list(head.next, newhead) #递归处理相似重复的问题
       head.next.next=head
       head.next=None
   return newhead

if __name__== '__main__':
    # 建立链表1->2->3->4->None
    head=ListNode(1)
    p1=ListNode(2)
    p2 = ListNode(3)
    p3 = ListNode(4)
    head.next=p1
    p1.next=p2
    p2.next=p3
    newhead=None
    rst =reverse_link_list(head, newhead)
    print(rst)
    while rst:
        print(rst.val)
        rst=rst.next