文章目录
线性表的顺序存储结构
- C/C++中借助数组来实现顺序表
基本操作
//线性表定义
#define MAX_SIZE 50
#define FAILED 0
#define SUCCESS 1
typedef int ElemType
typedef struct SqList
{
ElemType data[MAX_SIZE];
int length;
}SqList;
//**********************建立顺序表**********************//
SqList* CreateList(ElemType a[], int n)
{
int i = 0;
SqList* L = (SqList *)malloc(sizeof(SqList));
while (i < n)
{
L->data[i] = a[i];
i++;
}
L-> length = i;
return L;
}
//**********************初始化线性表**********************//
SqList* InitList()
{
SqList* L = (SqList*)malloc(sizeof(SqList));
L->length = 0;
return L;
}
//**********************销毁线性表**********************//
void DestroyList(SqList* L)
{
free(L);
}
//**********************判断线性表是否为空**********************