题解 | #反转链表#

/**
 * 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;
}