链表反转，C++实现

// To Compile and Run: g++ invert_list.cc -std=c++11 -Wall -O3 && ./a.out


#include <iostream>
#include <vector>


class ListNode {
public:
    int data;
    ListNode *pNext;

    ListNode()
    : data(0)
    , pNext(nullptr) {}
    ListNode(int i)
    : data(i)
    , pNext(nullptr) {}
};


ListNode *InvertList(ListNode *_pList) {
    ListNode *_pPrevious = nullptr;
    while (_pList != nullptr) {
        ListNode *tmpPtrNext = _pList->pNext;

        _pList->pNext = _pPrevious;

        _pPrevious = _pList;
        _pList = tmpPtrNext;
    }

    return _pPrevious;
}

int main(int argc, char const *argv[]) {
    const std::vector<int> arr {
        1, 2, 3
    };
    ListNode * const ROOT_PTR = new ListNode();
    ListNode *pList  = ROOT_PTR;
    for (int i: arr) {
        pList->pNext = new ListNode(i);
        pList = pList->pNext;
    }
    for (ListNode *p = ROOT_PTR->pNext; p != nullptr; p = p->pNext) {
        std::cout << p->data << "\t";
    }
    std::cout << "\n";

    pList = ROOT_PTR->pNext;
    ListNode *pNewRoot = InvertList(pList);
    for (ListNode *p = pNewRoot; p != nullptr; p = p->pNext) {
        std::cout << p->data << "\t";
    }
    std::cout << "\n";

    return 0;
}