题解 | #反转链表#

/**
 * struct ListNode {
 *	int val;
 *	struct ListNode *next;
 * };
 */

/**
 * 
 * @param pHead ListNode类 
 * @return ListNode类
 */
#include <math.h>
#include <stddef.h>
struct ListNode* ReverseList(struct ListNode* pHead ) {
	if(pHead == NULL || pHead->next == NULL)
		return pHead;
	struct ListNode *p, *q;
	p = pHead->next;
	pHead->next = NULL;
	while(p)
	{
		q = p;
		p = p->next;
		q->next = pHead;
		pHead = q;
	}
	return pHead;
}