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?

python代码实现：

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution:
    def reverseList(self, head):
        """
        :type head: ListNode
        :rtype: ListNode
        """
        dummy = None
        while head:
            tmp = ListNode(head.val)
            tmp.next = dummy         
            dummy = tmp         
            head = head.next
        return dummy

提示：
python有内存垃圾回收机制