链表元素的逆序输出

#include <stdio.h>
#include <stdlib.h>

#define ElemType int 
#define N 5                                      //定义链表的结点数目
typedef struct Node
{
    ElemType data; 
    struct Node *next;
}Node;
typedef struct Node *LinkList;



Node* CreatList(Node *La,int n)
{
    int i;
    struct Node *s;
    La = (LinkList)malloc(sizeof(Node));
    La->next = NULL;                         //初始化
    for(i = 1;i <= n;i++)
    {
        s = (LinkList)malloc(sizeof(Node));
        scanf("%d",&(s->data));
        s->next = La->next;
        La->next = s;                        //利用头插法构造链表
    }
        
    return La;
}
//函数值调换
int  SortList(Node *Lb,int n) 
{
    int i;
    int a[n];
    for(i = 0;i < n;i++)
    {
        Lb = Lb->next;
        a[i] = Lb->data;    
    }
    for(i = n-1;i >= 0;i--)
    {
        printf("%3d",a[i]);
    }
    return 1;
}
int main(int argc, char *argv[])

{
    int i;
    struct Node *L,*p;
    L = CreatList(L,N);
    p = L;
    printf("the data is:\n");
    for(i = 1;i <= N;i++)
    {
        p = p->next;
        printf("%3d",p->data);
    }
    printf("\nAfter sorted,the data is\n");
    SortList(L,N);
    getch();
//    system("pause"); 
    return 0;
}