链表逆置

#include<iostream>
using namespace std;


struct Node
{
int data;
Node *next;
};


int main()
{
int n;
while(cin>>n)
{
int i;
Node *root=new Node;
Node *r=root;
int x;
for(i=0;i<n;i++)
{
Node *p=new Node;
cin>>x;
p->data=x;
r->next=p;
r=p;
}
r->next=0;

Node *cur=root->next;
Node *pre=0;
Node *pNext;
delete root;
while(cur)
{
pNext=cur->next;
cur->next=pre;
pre=cur;
cur=pNext;
}


Node *temp=cur=pre;
while(cur)
{
cout<<cur->data<<" ";
cur=cur->next;
delete temp;
temp=cur;
}
cout<<endl;
}
return 0;
}