题目:
代码(首刷递归看解析 day2):
/**
* 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==NULL||head->next==NULL){
return head;
}
ListNode *ret = reverseList(head->next);
head->next->next=head;
head->next=NULL;
return ret;
}
};
代码(二刷双指针自解 day2):
/**
* 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==NULL||head->next==NULL) return head;
ListNode *cur=head;
ListNode *pre=head->next;
cur->next=NULL;
while(pre!=NULL){
ListNode *p=pre->next;
pre->next=cur;
cur=pre;
pre=p;
}
return cur;
}
};
代码(三刷看解析 2024年1月11日):
class Solution {
public:
ListNode* reverseList(ListNode* head) {
ListNode* temp;
ListNode* cur = head;
ListNode* pre = NULL;
while(cur) {
temp = cur->next;
cur->next = pre;
pre = cur;
cur = temp;
}
return pre;
}
};
代码(四刷自解 2024年3月4日)
做的太慢了
/**
* 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) return nullptr;
ListNode* pre = nullptr;
ListNode* cur = head;
ListNode* ahead = cur->next;
while (ahead != nullptr) {
cur->next = pre;
pre = cur;
cur = ahead;
ahead = ahead->next;
}
cur->next = pre;
return cur;
}
};
代码(五刷自解 2024年4月15日 1min bugfree)
class Solution {
public:
ListNode* reverseList(ListNode* head) {
if (!head) return head;
ListNode* pre = nullptr;
ListNode* cur = head;
ListNode* next;
while (cur) {
next = cur->next;
cur->next = pre;
pre = cur;
cur = next;
}
return pre;
}
};
代码 (六刷自解 2024年7月26日)
class Solution {
public:
ListNode* reverseList(ListNode* head) {
if (!head) return nullptr;
// 三个指针依次记录变更node,prenode,nextnode
ListNode* preNode = nullptr;
ListNode* node = head;
ListNode* nextNode = node->next;
while (nextNode != nullptr) {
node->next = preNode;
preNode = node;
node = nextNode;
nextNode = nextNode->next;
}
node->next = preNode;
return node;
}
};