#include<stdio.h>
#include<stdlib.h>
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASIBLE -1
#define OVERFLOW -2
#define LIST_INIT_SIZE 100
#define LISTINCREMENT 10
typedef int Status;
typedef char ElemType;
typedef struct{
ElemType *elem;
int length;
int listsize;
}SqList;
Status InitList(SqList &L){
//构造一个空的线性表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;
}
void DestoryList(SqList &L){
//销毁线性表
free(L.elem);
L.elem=NULL;
L.length=0;
L.listsize=0;
}
void ClearList(SqList &L){
//清空线性表
L.length=0;
}
Status ListEmpty(SqList L){
//判断线性表是否为空
if(L.length==0) return TRUE;
else return FALSE;
}
int ListLength(SqList L){
//返回线性表数据个数
return L.length;
}
Status GetList(SqList L,int i,ElemType &e){
//用e返回线性表第i个数据元素的值
if(i<1||i>L.length) return ERROR;
e=L.elem[i-1];
return OK;
}
int LocateElem(SqList L,ElemType e,Status(*compare)(ElemType,ElemType)){
//在顺序线性表中查找第一个值与e满足compare()的元素的位序
//若找到则返回位序，否则返回0
int i=1;
ElemType *p=L.elem;
while(i<=L.length&&!(*compare)(*p++,e))
++i;
if(i<=L.length) return i;
else return 0;
}
Status ListInsert(SqList &L,int i,ElemType e){
//在顺序线性表L中第i个位置之前插入新的元素e
ElemType *p,*q,*newbase;
if(i<1||i>L.length+1) return ERROR;
if(L.length>=L.listsize){
newbase=(ElemType*)realloc(L.elem,(L.listsize+LISTINCREMENT)*sizeof(ElemType));
if(!newbase) exit(OVERFLOW);
L.elem=newbase;
L.listsize+=LISTINCREMENT;
}
q=&(L.elem[i-1]);
for(p=&(L.elem[L.length-1]);p>=q;--p)
*(p+1)=*p;
*q=e;
++L.length;
return OK;
}
Status ListDelete(SqList &L,int i,ElemType &e){
//在顺序线性表L中删除第i个元素，并用e返回其值
ElemType *p,*q;
if((i<1)||(i>L.length)) return ERROR;
p=&(L.elem[i-1]);
e=*p;
q=L.elem+L.length-1;
for(++p;p<=q;++p)
*(p-1)=*p;
--L.length;
return OK;
}
