反转链表

#include<iostream>
#include<vector>

using namespace std;

struct Node
{
    int key;
    Node* L_Next;
};
Node* ReverseList(Node *List)
{
    Node* Reverse_L = NULL;
    Node* PNode = List->L_Next;
    Node* PPrev = NULL;
    while (PNode != NULL)
    {
        Node* Pnext = PNode->L_Next;
        if (Pnext == NULL)
        {
            Reverse_L = PNode;
        }
        PNode->L_Next = PPrev;
        PPrev = PNode;
        PNode = Pnext;
    }
    return Reverse_L;
}

int main(void)
{

    Node* L = new Node;
    L->L_Next = NULL;
    Node* p;
    p = L;
    vector<int>vec;
    int a;
    char temp;
    while (temp = cin.get() != '
')
    {
        cin.unget();
        cin >> a;
        vec.push_back(a);
    }
    for (int i = 0; i < vec.size(); i++)
    {
        Node* q = new Node;
        q->key = vec[i];
        q->L_Next = NULL;
        //q->L_Next = L->L_Next;
        //L->L_Next = q;
        while (p->L_Next != NULL)
        {
            p = p->L_Next;
        }
        p->L_Next = q;
    }

    p = L;
    while (p->L_Next != NULL)
    {
        p = p->L_Next;
        cout << p->key<<' ';
    }
    L=ReverseList(L);
    cout << endl;
    p = L;
    while (p != NULL)
    {
        cout << p->key << ' ';
        p = p->L_Next;
    }
    return 0;

}