九度oj题目1518：反转链表

 1 #include <cstdio>
 2 #include <cstring>
 3 #include <string>
 4 #include <queue>
 5 #include <stack>
 6 #include <iostream>
 7 using namespace std;
 8 struct node{
 9     node *fro,*next;
10     int v;
11 };
12 int main(){
13     //freopen("D:\\INPUT.txt","r",stdin);
14     node *head,*tail;
15     int n;
16     while(scanf("%d",&n)!=EOF){
17         if(!n){
18             cout<<"NULL"<<endl;
19         }
20         else{
21             head=new node();
22             tail=head;
23             head->fro=head->next=NULL;
24             scanf("%d",&head->v);
25             int i;
26             node *p;
27             for(i=1;i<n;i++){//输入
28                 p=new node();
29                 p->fro=tail;
30                 tail->next=p;
31                 scanf("%d",&p->v);
32                 p->next=NULL;
33                 tail=p;
34             }
35             cout<<tail->v;
36             p=tail->fro;
37             delete tail;
38             p->next=NULL;
39             tail=p;
40             while(tail!=head){//转置链表
41                 cout<<" "<<tail->v;
42                 p=tail->fro;
43                 delete tail;
44                 tail=p;
45             }
46             cout<<" "<<tail->v<<endl;
47             delete head;
48         }
49     }
50     return 0;
51 }