LeetCode206：Reverse Linked List

Reverse a singly linked list.

Example:

Input: 1->2->3->4->5->NULL
Output: 5->4->3->2->1->NULL

Follow up:

A linked list can be reversed either iteratively or recursively. Could you implement both?

---

LeetCode：链接

和剑指Offer_编程题15：反转链表是一样的，但是要求用两种方法。两种方法的runtime大概都打败了70%的人。

非递归：

# 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 not head or not head.next:
            return head
        last = None
        while head:
            tmp = head.next
            head.next = last
            last = head
            head = tmp
        return last

递归：

# 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 not head or not head.next:
            return head 
        '''递归到最后 head是倒数第二个结点 head.next是最后一个结点 返回值是自己 所以last是最后一个结点'''
        last = self.reverseList(head.next)
        '''我理解的是把倒数第二个结点的next指向last last再指回head 就相当于反转了'''
        head.next.next = head 
        '''把head向后指的指针清空 当反转到头指针的时候 头指针的next是None'''
        head.next = None
        return last