题解 | #反转链表#
反转链表
https://www.nowcoder.com/practice/75e878df47f24fdc9dc3e400ec6058ca
/**
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
/**
*
* @param pHead ListNode类
* @return ListNode类
*/
struct ListNode* ReverseList(struct ListNode* pHead ) {
struct ListNode* q = NULL;
while(pHead){
struct ListNode* p = pHead->next;
pHead->next = q;
q = pHead;
pHead = p;
}
return q;
}
安克创新 Anker公司福利 814人发布