题解 | 反转链表
反转链表
https://www.nowcoder.com/practice/75e878df47f24fdc9dc3e400ec6058ca
/**
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
/**
* 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
*
*
* @param head ListNode类
* @return ListNode类
*/
struct ListNode* ReverseList(struct ListNode* head ) {
// write code here
struct ListNode *p = head;
struct ListNode *pNew;
struct ListNode *pPrev = NULL;
struct ListNode *pNewHead = NULL;
while(p != NULL) {
pNew = p->next;
p->next = pPrev;
pPrev = p;
pNewHead = p;
p = pNew;
}
return pNewHead;
}
