题目
给你单链表的头节点 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* headroot = NULL;
ListNode* reversex(ListNode* head) {
if(head->next!=NULL) {
reversex(head->next)->next = head;
return head;
}
else {
headroot = head;
return head;
}
}
ListNode* reverseList(ListNode* head) {
if(head == NULL)
return head;
reversex(head);
head -> next = NULL;
return headroot;
}
};
迭代
/**
* 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* lasthead = NULL;
ListNode* curhead = NULL;
while(head!=NULL) {
curhead = head->next;
head->next = lasthead;
lasthead = head;
head = curhead;
}
return lasthead;
}
};