题目1518：反转链表

#include <iostream>
#include <cstdio>
#include <cstdlib>

using namespace std;
struct Node
{
int num;
Node * next ;
};

void print(Node * head)
{
int flag=1;
while(head->next)
{
printf("%d ",head->num);
head=head->next;
}
printf("%d",head->num);
}

int main()
{
int n;
Node * head=NULL;
Node * tail=head;

while(~scanf("%d",&n))
{
if(n==0) printf("NULL\n");
else
{
int t;
Node * temp=(Node *)malloc(sizeof(Node ));
temp->next=NULL;
head=temp;
tail=head;
while(n--)
{
scanf("%d",&t);
temp=(Node *)malloc(sizeof(Node ));
temp->num=t;
temp->next=head->next;
head->next=temp;
}
print(head->next);
printf("\n");
}
}
return 0;
}

/**************************************************************
Problem: 1518
User: 萧然677
Language: C++
Result: Accepted
Time:150 ms
Memory:2972 kb
****************************************************************/