题解 | #反转链表2#

/* struct ListNode { int val; struct ListNode next; ListNode(int x) : val(x), next(NULL) { } };/ class Solution { public: ListNode* ReverseList(ListNode* pHead) { if (pHead==0) return nullptr; else { ListNode* pre=nullptr; ListNode* cur=pHead; ListNode* nex=cur->next;

        while(cur!=nullptr)
        {
            nex=cur->next;
            cur->next=pre;
            pre=cur;
            cur=nex;
           
            
        }
        return pre;
    }
}

};