python--剑指offer--24. 反转链表_简单

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

示例:

输入: 1->2->3->4->5->NULL
输出: 5->4->3->2->1->NULL

限制：

0 <= 节点个数 <= 5000

代码实现

class ListNode:
    def __init__(self, x):
        self.val = x
        self.next = None

class Solution:
    def reverseList(self, head: ListNode) -> ListNode:
        if not head:
            return head

        p = head.next
        head.next = None
        while p:
            # q = p.next
            # p.next = head
            # head = p
            # p = q
            p.next, head, p = head, p, p.next
        return head

[题目来源于leetcode剑指offer]