数据结构C语言的描述第三版 -顺序表的初始化
顺序表
#include <stdio.h>
#include <stdlib.h>
typedef int DataType;
typedef struct student
{
int MAX;
DataType n;
int length;
}stu1;
typedef struct student *list;
list_createNULLlist(int m)
{
list plist=(list)malloc(sizeof(struct student));
if(plist!=NULL)
{
plist->n=(DataType*)malloc(sizeof(DataType)*m);
if(plist->n)
{
plist->MAX=m;
plist->n=0;
return plist;
}
else free(plist);
}
printf("out of space!!\n");
return NULL;
}
int main()
{
int m;
printf("please input size of the list :");
scanf("%d",&m);
printf("%d\n",list_createNULLlist(m));
return 0;
}