题目

July 10, 2021 · View on GitHub

给你单链表的头节点 head ,请你反转链表,并返回反转后的链表。  

示例 1:

image

输入:head = [1,2,3,4,5]
输出:[5,4,3,2,1]

示例 2:

image

输入:head = [1,2]
输出:[2,1]

示例 3:

输入:head = []
输出:[]

提示:

  • 链表中节点的数目范围是 [0, 5000]
  • -5000 <= Node.val <= 5000

参考答案

class Solution {
public:
    ListNode* reverseList(ListNode* head) {
        if (!head || !head->next) {
            return head;
        }
        ListNode* newHead = reverseList(head->next);
        head->next->next = head;
        head->next = nullptr;
        return newHead;
    }
};