C++实现链表逆置

#include<stdlib.h>   
#include<iostream.h>   
#include<stdio.h>    
#define   MaxSize 1024                                                                                                         
typedef int ElemType;           
typedef struct list1       
{   
         ElemType data;   
         struct   list1 *next;   
}list1,     
*LinkList; 
//构造一个单链表L,根据用户输入的数据确定该链表的长度和每个结点的值
void CreateList_L(LinkList &L,int n)    
{     
      int i;   
      list1 *p;   
      int array[MaxSize];                   //定义一个数组 
      L=(LinkList)malloc(sizeof(list1));    //指针使用前要初始化
      L->next=NULL;   
      printf("请输入结点的数据(data)域,必须为整数,以回车或者空格作为间隔(形如:34 20 2 3 10 51 12)\n");     
      for(i=0;i<n;i++)                               //输入结点的data元素   
    scanf("%d",&array[i]);   
      for(i=n-1;i>=0;--i)   
      {   
      p=(LinkList)malloc(sizeof(list1));            //新建结点   
         p->data=array[i];                             //给链表的数据域赋值   
         p->next=L->next; 
         L->next=p;                                    //在链表的头部插入结点,即头插法
      }