数据结构.
listDelete(&L,i,&e)
Status ListDelete(List &L,int I,ElemType &e)
{ if ((iL.length))return Error;
p=*(L.elem[i-1]);
e=*p;
q=L.elem+L.length-1;
for(++p;p
数据结构.
listDelete(&L,i,&e)
Status ListDelete(List &L,int I,ElemType &e)
{ if ((iL.length))return Error;
p=*(L.elem[i-1]);
e=*p;
q=L.elem+L.length-1;
for(++p;p