题解 | #反转链表#
反转链表
https://www.nowcoder.com/practice/75e878df47f24fdc9dc3e400ec6058ca
/*
struct ListNode {
int val;
struct ListNode *next;
ListNode(int x) :
val(x), next(NULL) {
}
};*/
class Solution {
public:
ListNode* ReverseList(ListNode* pHead) {
if(pHead == NULL || pHead->next == NULL){
return pHead;
}
ListNode* last = ReverseList(pHead->next);
pHead->next->next = pHead;
pHead->next = nullptr;
return last;
}
};
安克创新 Anker公司福利 728人发布
查看21道真题和解析
