题解 | #反转链表#

/**
 *
 * @param pHead ListNode类
 * @return ListNode类
 */
struct ListNode* ReverseList(struct ListNode* pHead ) {
    struct ListNode* p = NULL;
    struct ListNode* new_p = NULL;
    p = pHead;
    if (p == NULL) {
        return p;
    } else if (p->next == NULL) {
        return p;
    } 
    while (pHead != NULL){
        p = pHead;
        pHead = pHead->next;
        p->next = new_p;
        new_p = p;

    }
    return new_p;

}