反转链表

struct ListNode
{
    int m_nValue;
    ListNode *m_pNext;
};

    
class TestPointer
{
public:
    ListNode* reverseListNode(ListNode *pHead);
    void printNode(ListNode *pNode);

private:
    ListNode* reverseCode(ListNode *pNode);
};

ListNode * TestPointer::reverseCode(ListNode *pNode)
{
    if (pNode->m_pNext == nullptr)
        return pNode;

    ListNode *pReverseHead= reverseCode(pNode->m_pNext);
    ListNode *pCurNode= pReverseHead;
    while(pCurNode->m_pNext != nullptr)
    {
        pCurNode = pCurNode->m_pNext;
    }
    
    pCurNode->m_pNext = pNode;
    pNode->m_pNext = nullptr;
return pReverseHead;
}

void TestPointer::printNode(ListNode *pNode)
{
    while(pNode != nullptr)
    {
        cout << pNode->m_nValue << "-";
        pNode = pNode->m_pNext;
    }

    cout << endl;
}