😝迭代
1
2
3
4
5
6
7
8
9
10
11
12
13
14
| class Solution {
public:
ListNode* reverseList(ListNode* head) {
ListNode* pre = nullptr,
*curr = head;
while(curr) {
ListNode* nextTemp = curr->next;
curr->next = pre;
pre = curr;
curr = nextTemp;
}
return pre;
}
};
|
Accepted
27/27 cases passed (4 ms)
Your runtime beats 99.08 % of cpp submissions
Your memory usage beats 76.29 % of cpp submissions (9.1 MB)
🙃递归
1
2
3
4
5
6
7
8
9
10
11
| class Solution {
public:
ListNode* reverseList(ListNode* head) {
if(!head || !head->next)
return head;
auto p = reverseList(head->next);
head->next->next = head;
head->next = nullptr;
return p;
}
};
|
Accepted
27/27 cases passed (4 ms)
Your runtime beats 99.08 % of cpp submissions
Your memory usage beats 5.08 % of cpp submissions (9.4 MB)
