题解 | #反转链表#
反转链表
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) {
ListNode*p=NULL;
ListNode*c=pHead;
ListNode*n=NULL;
while(c!=NULL)
{
n=c->next;
c->next=p;
p=c;
c=n;
}
pHead=p;
return pHead;
}
};
