给你单链表的头节点 head ,请你反转链表,并返回反转后的链表。
示例 1:
输入:head = [1,2,3,4,5]
输出:[5,4,3,2,1]
示例 2:
输入:head = [1,2]
输出:[2,1]
示例 3:
输入:head = []
输出:[]
提示:
链表中节点的数目范围是
[
0
,
5000
]
[0, 5000]
[0,5000]
−
5000
<
=
N
o
d
e
.
v
a
l
<
=
5000
-5000 <= Node.val <= 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 * dfs(ListNode* u){
if(u == nullptr) return u;
ListNode * child = u->next;
if(child == nullptr) return u;
ListNode * h = dfs(child);
u -> next = nullptr;
child -> next = u;
return h;
}
ListNode* reverseList(ListNode* head) {
return dfs(head);
}
};
解法二:迭代
/**
* 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* pre = nullptr, *ne = nullptr;
while(head != nullptr){
ne = head -> next;
head->next = pre;
pre = head;
head = ne;
}
return pre;
}
};