题解 | #反转链表#

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

/**
 * 
 * @param pHead ListNode类 
 * @return ListNode类
 */
struct ListNode* ReverseList(struct ListNode* pHead ) {
    // write code here
    struct ListNode *tmp, *p, *q;
    if(pHead == NULL){
        return pHead;
    }
    tmp = pHead;
    p = pHead->next;
    pHead->next = NULL;

    while(p != NULL){
        q = p->next;
        p->next = tmp;
        tmp = p;
        p = q;
    }
    return tmp;
    

}