1、return 0;if (L.length=L.listsize)int *newbase=( int *)realloc(L.elem,(L.listsize+10)* sizeof (int );newbase)L.elem=newbase; L.listsize+=10;int *q=&(L.elemi-1);int *p=&(L.elemL.length-1);for (p;p=q;-p)*(p+1)=*p; *q=e;+L.length;int ListDelete(SqList &L, int i, int &e) if (iL.length) return 0; e=*p;int
2、 *q=L.elem+L.length-1;for (+p;p+p)*(p-1)=*p;-L.length; return e;int main()int a6=1,2,3,4,5;a1;a4; for (p;-p) *(p+1)=*p;*q=3;for ( int i=0;i6;i+) coutai ; coutendl; SqList lx;Init_Sq(lx);for ( int j=1;j10;j+) ListInsert(lx,j,j);ListInsert(lx,3,55); int e_return;ListDelete(lx,4,e_return); for ( int m=
3、0;mm+) cout*(lx.elem+m) coutcoutnext=NULL;int ListInsert(LinkList &L, int i, int e)LinkList p=L;int j=0;while (p&i-1) p=p-next; +j;if (!p|ji-1) return 0;LinkList s=(LinkList)malloc( sizeof (LNode); s-data=e;s-next=p- p-next=s;int ListDelete(LinkList &L, int i)while (p-next&(p-next)|jLinkList q=p-nex
4、t=q- free(q);int GetElem(LinkList L, int i)LinkList p=L-int j=1;i)p=p-+j;p|jdata;int main()LinkList lx;InitList(lx);for ( int i=1;i+)ListInsert(lx,i,i);ListDelete(lx,2);5;j+)GetElem(lx,j)LinkList lx1,lx2;InitList(lx1);InitList(lx2);for ( int m=1;m+)ListInsert(lx1,m,m);for ( int n=1;nn+) ListInsert(l
5、x2,n,2*n);GetElem(lx1,j)next=L;prior=L;int GetElem(DLinkList &DLinkList p,s;p=L-i) p=p-return e;DLinkList lx;i+) ListInsert(lx,i,2*i-1);j+) coutint e;ListDelete(lx,2,e);e=S.stacksize)S.base=( int *)realloc(S.base,(S.stacksize+STACKINCREMENT)* sizeof (int );S.top=S.base+S.stacksize;S.stacksize+=STACKINCREMENT;*S.top+=e;int Pop(Stack &e=*-S.top;Stack lx;InitStack(lx);Push(lx,i); int e;GetTop(lx,e); cout int e1;Pop(lx,e1);e1 return 1;int DestroyQueue(LinkQueue &Q)while (Q.front) Q.rear=Q.front-free(Q.front); Q.front=Q.rear; return 1;int Insert(LinkQueue &Q, int e)QueuePtr p=(QueuePtr)malloc( s
copyright@ 2008-2022 冰豆网网站版权所有
经营许可证编号:鄂ICP备2022015515号-1