感覺你們好厲害啊

#include<stdio.h>
#include<stdlib.h>
#define?list_init_size?5
#define?listincrement?10
#define?overflow?-2
typedef?int?status;
typedef?int?elemtype;?
typedef?struct
{
?elemtype?*elem;
?int?????length;
?int?????listsize;
}?sqlist;
status?initlist_sq(sqlist?&L)
{
?L.elem=(elemtype?*)malloc(list_init_size?*?sizeof(elemtype));
?if(!L.elem)?exit(overflow);
?L.length=0;
?L.listsize=list_init_size;
?return?1;
}

//鏈表初始化
#include?<stdio.h>
#include?<stdlib.h>
typedef?int?status;
typedef?status?elemtype;

typedef?struct?Lnode?
{
?elemtype?date;
?struct?Lnode?*next;
}Lnode?,?*linklist;
linklist?L;

void?createlist_L(linklist?&L,?int?n)
{???
?linklist?p;
?L=(linklist)malloc(sizeof(Lnode));
?L->next=NULL;
?for?(int?i=n;i>0;--i)
?{???
??p=(linklist)malloc(sizeof(Lnode));
??printf("請輸入鏈表的第%d個數!\n",i);
??scanf("%d",&p->date);
??p->next?=?L->next;
??L->next?=?p;
?}
}
在主函數直接調用,就會初始化為空了!!!
順序表剛剛初始化要5個elemtype型空間,大于5的話,直接改#define?list_init_size?5改為想要的大小
鏈表不需要要大小