递归:一个建新链表的过程
# Definition for singly-linked list.
# class ListNode(object):
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution(object):
def reverseList(self, head):
"""
:type head: ListNode
:rtype: ListNode
"""
if head == None or head.next == None:
return head
p = self.reverseList(head.next) #最后返回的结果,p为新链表的表头
# 交换当前head 和 head.next
head.next.next = head
head.next = None
return p