【力扣 简单 C++】206. 反转链表

目录

题目

解法一：迭代

解法二：递归

题目

待添加

解法一：迭代

class Solution
{
private:ListNode* reverse(ListNode* head){ListNode* newHead {};while (head){ListNode* nextNode {head->next};head->next = newHead;newHead = head;head = nextNode;}return newHead;}public:ListNode* reverseList(ListNode* head){return reverse(head);}
};

解法二：递归

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