数据结构实验之链表二：逆序建立链表

Problem Description

输入整数个数N，再输入N个整数，按照这些整数输入的相反顺序建立单链表，并依次遍历输出单链表的数据。

Input

第一行输入整数N;；
第二行依次输入N个整数，逆序建立单链表。

Output

依次输出单链表所存放的数据。

Example Input

10
11 3 5 27 9 12 43 16 84 22 

Example Output

22 84 16 43 12 9 27 5 3 11 

Hint

不能使用数组！

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#define ERROR -1
#define OVERFLOW -2
#define OK 1

typedef int Elemtype;
typedef int Statu;
typedef struct Lnode
{
    Elemtype data;
    struct Lnode *next;
} Link;

Link * Creat(int n);
Link * Creat_neg(int n);
Statu Dis_Link(Link *head);

int main()
{
    int n;
    Link *head;
    scanf("%d", &n);
    head = Creat_neg(n);
    Dis_Link(head);
    return 0;
}
Link *Creat(int n)
{
    Link *head, *p, *q;
    head = (Link *)malloc(sizeof(Link));
    head -> next = NULL;
    q = head;
    while(n--)
    {
        p = (Link *)malloc(sizeof(Link));
        p -> next = NULL;
        scanf("%d", &p -> data);
        q -> next = p;
        q = p;
    }
    return head;
}
Link * Creat_neg(int n)
{
   Link *head, *p;
   head = (Link *)malloc(sizeof(Link));
   head -> next = NULL;
   while(n--)
   {
       p = (Link *)malloc(sizeof(Link));
       p -> next = head -> next;
       scanf("%d", &p -> data);
       head -> next = p;
   }
   return head;
}
Statu Dis_Link(Link *head)
{
    Link *p;
    p = head -> next;
    while(p -> next)
    {
        printf("%d ", p -> data);
        p = p -> next;
    }
    printf("%d\n", p -> data);
    return OK;
}