op2-1文件:
void InitList(SqList&L){
L.elem=(ElemType*)malloc(LIST_INIT_SIZE*sizeof(Elem Type));
if(!L.elem)exit(OVERFLOW);
L.length=0;
L.listsize=LIST_INIT_SIZE;
}
int ListLength(SqList L){
return L.length;
}
Status ListEmpty(SqList L)
{ if(L.length==0)return TRUE;
else return FALSE;}
Status ListInsert(SqList &L,int i,ElemType e){
ElemType*newbase,*q,*p;
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){
ElemType*p,*q;
if(i<1||i>L.length||L.length==0)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 GetElem(SqList L,int i,ElemType&r)
{
if(i<1||L.length||L.length==0)return ERROR;
e=L.elem[i-1];
return Ok;
}
int LocateElem(SqList L,ElemType e)
{
int i=1;
ElemType*p=L.elem;
while(i<=L.length&&(*p++!=e))++i;
if(i<=L.length) return i;
else return 0;
}