翻转链表

代码:

struct ListNode{    int m_nValue;    ListNode* m_pNext;};ListNode* ReverseList(ListNode *pHead){    ListNode* pReverseList = nullptr;    ListNode* pCur = pHead;    ListNode* pPrev = nullptr;    while (pCur != nullptr)    {        ListNode *pNext = pCur->m_pNext;        if (pNext == nullptr)            pReverseList = pCur;        pCur->m_pNext = pPrev;        pPrev = pCur;        pCur = pNext;    }    return pReverseList;}