题解 | #反转链表#
反转链表
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)
return NULL;
ListNode* p = pHead;
ListNode* q;
ListNode* list = NULL;
while(p != NULL){
q = p->next;;
p->next = list;
list = p;
p = q;
}
return list;
}
};
查看15道真题和解析
