逆序建链表

逆序建链表其实是一道很简单得程序题目，稍微动一下脑袋，就能找到门路，我们学习这个的时候只用了几分钟就把自己的链表建立起来了

#include<stdio.h>
#include<stdlib.h>
struct node
{
    int num;
    struct node *next;
};
int main()
{
    struct node *head,*p;
    int i,n;
    scanf("%d",&n);
    head = (struct node *)malloc(sizeof(struct node));
    head->next = NULL;
    i = n;
    while(i--)
    {
        p = (struct node *)malloc(sizeof(struct node));
        scanf("%d",&p->num);
        p->next = head->next;
        head->next = p;
    }
    p = head->next;
    for(i = 0;i < n;i++)
    {
        if(i)printf(" ");
        printf("%d",p->num);
        p = p->next;
    }
    return 0;
}