python 反转链表

反转链表

定义一个函数，输入一个链表的头节点，反转该链表并输出反转后链表的头节点。

示例:

输入: 1->2->3->4->5->NULL
输出: 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: ListNode) -> ListNode:
        if not head or not head.next:
            return head
        
        new_head = self.reverseList(head.next)
        head.next.next = head
        head.next = None

        return new_head

    # 头插法解题
    def reverseList(self, head: ListNode) -> ListNode:
        new_head = None
        while head:
            per = head.next # 记录下一个节点
            head.next = new_head # 把new_head 赋值给head.next 
            new_head = head # 把head 重新赋值给new_head
            head = per  # 跳到下一个节点

        return new_head