#define LIST_INIT_SIZE 100 //顺序表存储空间的初始分配量
#define LISTINCREMENT 10 //顺序表存储空间的分配增量
typedef struct
{ ElemType *elem; //存储空间的基地址
int length; //顺序表的当前长度
int listsize; //数组存储空间的长度
}SqList;
//定义比较函数
Status equal(ElemType a,ElemType b){
if(a==b) return TRUE;
else return FALSE;
}
//定义访问函数
Status print(ElemType e){
printf(e);
return OK;
}
//顺序表的初始化操作
Status InitList(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;
}
//顺序表的销毁操作
void DestroyList(SqList &L)
{
if(L.elem) free(L.elem);
L.elem=NULL;
}
//顺序表的清空操作
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 GetElem(SqList L,int i,ElemType &e){
if(i<1 || i>L.length) return ERROR;
e=L.elem[i-1];
return OK;
}
//定位
int LocateElem (SqList L,ElemType e)
{
i=1;
while( i<=L.length && L.elem[i-1]!=e) i++ ;
if(i<=L.length) return i;
else return 0;
}
//定义比较,求前驱和后继的操作
int LocateElem (SqList L, ElemType e, Status (*compare)(ElemType, ElemType))
{
i=1; 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){
//ElemType *p,*q;
if(i<1 ||i>L.length+1) return ERROR;
if(L.length==L.listize)
{
L.elem=(ElemType *) realloc(L.elem,(L.listsize+LISTINCREMENT)*sizeof(ElemType));
if(!L.elem) exit(OVERFLOW);
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){
//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;
}
//线性表的历遍操作
Status ListTraverse(SqList L,Status (*visit)(ElemType))
{ int i;
for(i=0;i<L.length;i++)
if(!visit(L.elem[i])) return ERROR;
return OK;}
Status PriorElem(SqList L,ElemType e,ElemType* pre_e){ //取e的前驱元素
int i;
i=LocateElem(L,e);
if(i==1)
{
printf("此元素没有前驱元素\n");
return ERROR;
}
pre_e=&L.elem[i-2];
return OK;
}
Status NextElem(SqList L,ElemType e,ElemType* next_e){ //取e的后继元素
int i;
i=LocateElem(L,e);
if(i==L.length)
{
printf("此元素没有后继元素\n");
return ERROR;
}
next_e=&L.elem[i];
return OK;
}
#define LISTINCREMENT 10 //顺序表存储空间的分配增量
typedef struct
{ ElemType *elem; //存储空间的基地址
int length; //顺序表的当前长度
int listsize; //数组存储空间的长度
}SqList;
//定义比较函数
Status equal(ElemType a,ElemType b){
if(a==b) return TRUE;
else return FALSE;
}
//定义访问函数
Status print(ElemType e){
printf(e);
return OK;
}
//顺序表的初始化操作
Status InitList(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;
}
//顺序表的销毁操作
void DestroyList(SqList &L)
{
if(L.elem) free(L.elem);
L.elem=NULL;
}
//顺序表的清空操作
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 GetElem(SqList L,int i,ElemType &e){
if(i<1 || i>L.length) return ERROR;
e=L.elem[i-1];
return OK;
}
//定位
int LocateElem (SqList L,ElemType e)
{
i=1;
while( i<=L.length && L.elem[i-1]!=e) i++ ;
if(i<=L.length) return i;
else return 0;
}
//定义比较,求前驱和后继的操作
int LocateElem (SqList L, ElemType e, Status (*compare)(ElemType, ElemType))
{
i=1; 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){
//ElemType *p,*q;
if(i<1 ||i>L.length+1) return ERROR;
if(L.length==L.listize)
{
L.elem=(ElemType *) realloc(L.elem,(L.listsize+LISTINCREMENT)*sizeof(ElemType));
if(!L.elem) exit(OVERFLOW);
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){
//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;
}
//线性表的历遍操作
Status ListTraverse(SqList L,Status (*visit)(ElemType))
{ int i;
for(i=0;i<L.length;i++)
if(!visit(L.elem[i])) return ERROR;
return OK;}
Status PriorElem(SqList L,ElemType e,ElemType* pre_e){ //取e的前驱元素
int i;
i=LocateElem(L,e);
if(i==1)
{
printf("此元素没有前驱元素\n");
return ERROR;
}
pre_e=&L.elem[i-2];
return OK;
}
Status NextElem(SqList L,ElemType e,ElemType* next_e){ //取e的后继元素
int i;
i=LocateElem(L,e);
if(i==L.length)
{
printf("此元素没有后继元素\n");
return ERROR;
}
next_e=&L.elem[i];
return OK;
}