leedcode-206. 反转链表

反转一个单链表。

示例:

输入: 1->2->3->4->5->NULL
输出: 5->4->3->2->1->NULL
进阶:
你可以迭代或递归地反转链表。你能否用两种方法解决这道题？

---

这个题目比较的简单:
先用一个循环的迭代就可以反转

# 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:
            return head
        last_p = head
        cur_p = head.next
        head.next = None
        while cur_p != None:
            next_p = cur_p.next
            cur_p.next = last_p
            last_p = cur_p
            cur_p = next_p
        return last_p

在使用递归来完成,递归就可以把大问题分解成小的子问题来解决:

class Solution(object):
    def reverse(self,pre,cur):
        if cur==None:
            return pre
        m_next = cur.next
        cur.next = pre
        return self.reverse(cur,m_next)
        
    def reverseList(self, head):
        """
        :type head: ListNode
        :rtype: ListNode
        """
        return self.reverse(None,head)
        ```