链表倒置

#include<stdio.h>
#include<stdlib.h>
int m;

typedef struct LNode{
?int data;
?struct LNode *next;
}LNode,*LinkList;

LNode *L,*p,*first;

void CreatList_L(LinkList L,int n){
?int i;
?L=(LinkList)malloc(sizeof(LNode));
?L->next=NULL;
?p=L;
?for(i=n;i>0;--i)
?{
??p=(LinkList)malloc(sizeof(LNode));
??scanf("%d",&p->data);
??p->next=L->next;
??L->next=p;
? }
}
void main()
{
?void CreatList_L(LinkList L,int n);
?void change(LinkList L,int n);
?printf("请输入数据：");
?scanf("%d",&m);
?CreatList_L(first,m);
?printf("倒置后的链表如下：/n");
?change(p,m);
}

void change(LinkList L,int n){?int i;?for(i=1;i<=n;i++)?{??printf("%d ",p->data);??p=p->next;?}}