题解 | #反转链表#
反转链表
https://www.nowcoder.com/practice/75e878df47f24fdc9dc3e400ec6058ca
class Solution {
public:
ListNode* ReverseList(ListNode* pHead) {
if (pHead==NULL) return pHead;
ListNode*pre=pHead,*p,*post;
p=pre->next;
pre->next=NULL;
while(p!=NULL)
{
post=p->next;
p->next=pre;
pre=p;
p=post;
}
pHead=pre;
return pHead;
}
};