题解 | #反转链表#
反转链表
https://www.nowcoder.com/practice/75e878df47f24fdc9dc3e400ec6058ca
/** * struct ListNode { * int val; * struct ListNode *next; * }; */ /** * * @param pHead ListNode类 * @return ListNode类 */ struct ListNode* ReverseList(struct ListNode* pHead ) { // write code here struct ListNode* cur=NULL; struct ListNode*pre; struct ListNode *tmp; pre=pHead; while(pre) { tmp=pre->next; pre->next=cur; cur=pre; pre=tmp; } return cur; }