线性表操作

//SqList.h
#define MAXSIZE 100
typedef int ElemType;
typedef struct{
	ElemType *elem;//存储空间的基地址
	int length;//当前长度 
}SqList;//顺序表SqList 

//SqList_Operation.cpp
// 1 InitList 构建空表
Status InitList(SqList &L){
	L.elem = new ElemType[MAXSIZE];//为线性表动态分配一个大小为MAXSIZE的数组空间
	if(!L.elem) exit( OVERFLOW);
	L.length = 0;
	return OK; 
}

// 2 GetElem 取值
Status GetElem(SqList L, int i, ElemType &e){
	if(i < 1 || i > L.length) return ERROR;
	e = L.elem[i-1];
	return OK;
} 

// 3 LocateElem 查找
int LocateElem(SqList L, ElemType e){
	for(int i = 0; i < L.length; i++)
		if(L.elem[i] == e) return i + 1;
	return 0;
}

// 4 ListInsert 插入
Status ListInsert(SqList &L, int i, ElemType e){
	if(i < 1 || i > (L.length + 1)) return ERROR;
	
	if(L.length == MAXSIZE) return ERROR;
	
	for(int j = L.length - 1; j >= i - 1; j--)
		L.elem[j+1] = L.elem[j];
	L.elem[i-1] = e;
	++ L.length;
	return OK;
} 

// 5 ListDelete 删除
Status ListDelete(SqList &L, int i){
	if(i < 1 || i > L.length) return ERROR;
	
	for(; i <= L.length - 1; i++)
		L.elem[i-1] = L.elem[i];
	-- L.length;
	return OK;
}