Reverse Linked List

题目

Reverse a singly linked list.

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

总结

思路一：递归，从后往前反转
代码：

# 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
        """
        if head == None or head.next == None:
            return head
        
        tail = head
        while tail.next is not None:
            tail = tail.next
            
        def reverse(node):
            if node.next is not None and node.next.next is not None:
                reverse(node.next)
            node.next.next = node
        
        reverse(head)
        head.next = None
        return tail

思路二：从前往后反转，用指针记录信息

# 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
        """
        if head is None:
            return None
        current = head
        next = current.next
        pre = None
        while next is not None:
            current.next = pre
            pre = current
            current = next
            next = next.next
        current.next = pre
        return current