《数据结构》 严蔚敏版 算法实现【C语言】
1.线性表
- 算法2.3 InitList_Sq
#include <stdio.h>
#include <stdlib.h>
#define LIST_INIT_SIZE 100
#define LISTINCREMENT 10
#define ERROR -1
#define OK 1
#define OVERFLOW -2
typedef int ElemType;
typedef int Status;
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 OK;
}
int main()
{
SqList list1,list2;
int a = 9;
a = InitList_Sq( &list1);
printf("%d %d %d %d \n %d %d %d \n ",a,list1.elem, list1.length, list1.listsize, list2.elem, list2.length, list2.listsize);
printf("%d",list2.elem);
return 0;
}