题解 | #反转链表#

/* struct ListNode { int val; struct ListNode next; ListNode(int x) : val(x), next(NULL) { } };/ class Solution { public: ListNode* ReverseList(ListNode* pHead) {

    ListNode* pNew = NULL;
    while(pHead != NULL){
        ListNode* temp = pHead->next;
        pHead->next = pNew;
        pNew = pHead;
        pHead = temp;
    }
    return pNew;
}

};