转置单链表

struct Node
{
    int nValue;
    Node* pNext;
    Node(int n = 0) : nValue(n), pNext(nullptr) {};
    friend ostream& operator<<(ostream& os, Node* pNode);
};

ostream& operator<<(ostream& os, Node* pNode)
{
    Node* pTravel = pNode;
    while (pTravel != nullptr)
    {
        os << pTravel->nValue<<" ";
        pTravel = pTravel->pNext;
    }
    return os;
}

Node* GetInitList()
{
    Node* pTemp = nullptr;
    int nCount = 5;
    while (nCount > 0)
    {
        Node* pAdd = new Node;
        pAdd->nValue = nCount;
        pAdd->pNext = pTemp;
        pTemp = pAdd;
        nCount--;
    }
    return pTemp;
}

Node* TransList(Node* pHead)
{
    Node* pForward = nullptr;
    Node* pBack = pHead;
    Node* pTemp = nullptr;

    while (pBack != nullptr)
    {
        pTemp = pBack->pNext;
        pBack->pNext = pForward;
        pForward = pBack;
        pBack = pTemp;
    }

    return pForward;
}

int main()
{
    auto pHead = GetInitList();
    cout << pHead << endl;

    pHead = TransList(pHead);
    cout << pHead << endl;

    system("pause");
    return 0;
}

面试的时候，多次遇到。