题目描述: 给你单链表的头节点 head ,请你反转链表,并返回反转后的链表→题目链接。
示例 1:
输入:head = [1,2,3,4,5]
输出:[5,4,3,2,1]
示例 2:
输入:head = [1,2]
输出:[2,1]
示例 3:
输入:head = []
输出:[]
提示: 链表中节点的数目范围是 [0, 5000]
-5000 <= Node.val <= 5000
代码实现:
- 迭代实现
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* reverseList(ListNode* head) {
ListNode* prev = nullptr;
ListNode* last;
ListNode* curr = head;
while(curr != nullptr)
{
last = curr->next;
curr->next = prev;
prev = curr;
curr = last;
}
return prev;
}
};
迭代实现的详细过程如下图所示。
- 递归实现
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* reverseList(ListNode* head) {
if(head == nullptr || head->next == nullptr)
{
return head;
}
ListNode* new_head = reverseList(head->next);
head->next->next = head;
head->next = nullptr;
return new_head;
}
};
递归实现的详细过程如下图所示。
代码执行结果:
- 示例1:[1,2,3,4,5]
- 示例2:[1,2]
- 示例3:[]