#include <stdio.h>
#include <conio.h>
#include <stdlib.h>
#define OK 1
#define ERROR 0
#define OVERFLOW 0
#define LIST_INIT_SIZE 100 //存储空间初始分配量
#define LISTINCREMENT 10 //存储空间分配增量
typedef struct
{
int *elem;
int length; //当前表长
int listsize; //当前分配的存储容量
}SqList;
int InitList_Sq(SqList & L) //构造一个空的顺序表
{
L.elem = (int*)malloc(LIST_INIT_SIZE * sizeof(int));
if (!L.elem)
exit(OVERFLOW);
L.length = 0;
L.listsize = LIST_INIT_SIZE;
return OK;
}
int AddList_Sq(SqList & L) //向顺序表中添加元素
{
int i = 0;
printf("Input the datas: ");
for (i = 0 ; i < L.length ; i++)
{
scanf("%d", &L.elem[i]);
}
return OK;
}
void main(void)
{
int i = 0, n = 0;
SqList L;
InitList_Sq(L); //建立顺序表
printf("\nInput the length of the list L: ");
scanf("%d", &n);
L.length = n; //记录顺序表的长度
AddList_Sq(L); //向顺序表中添加元素
printf("Output the datas: \n");
for (i = 0 ; i < L.length ; i++)
printf("elem[%d] = %d\n", i, L.elem[i]);
printf("\n");
}