ʱ : 数据结构(C语言?习题解答 - 百度文库ϿʼĶ
.
1.3 nдгüǺšעƵȣ (2) i=1; k=0; do {
k+=10*i; i++;
}while(i<=n-1) n=1ʱִ1
n>=2ʱִn-1Σ (3) i=1; k=0; do {
k+ = 10*i; i++; }while(i==n); n=2ʱִ2Σ n!=2ʱִ1Σ
(4) i=1; j=0;
while(i+jn) {
if(i x=n; y=0; //nDzС1ij while(x>=(y+1)*(y+1)){ y++; } ȡ) x=91; y=100; while ( y>0 ) if(x>100) { x-=10; y--; } } else x++ ; ִ(6) Ifִ100 (7) for( i=0; i for( j=i; j for( k=j; k . . . n?1n?1i?0j?ị??(n?j)?ڶ n(n?1)(n?2) 62.3 ֪˳LaԪذǵݼСдһ㷨Ԫx嵽Laĺλϣָñԡ ˼·жԱĴ洢ռǷErrorӺǰƶݣҵʵλò롣 Status Insert_SqList(SqList &La,int x)//x La { if(La.length==La.listsize) return ERROR; for(i=La.length-1;La.elem[i]>x&&i>=0;i--) La.elem[i+1]=La.elem[i]; La.elem[i+1]=x; La.length++; return OK; }//Insert_SqList 2.5 дһ㷨ʵ˳ľ͵ãԭĴ洢ռ佫Աa1,a2, ..., an-1,anΪ(an,an-1, ..., a2,a1) //˼·ָʾijͬʱֱ˳Ŀʼͽβı void reverse(SqList &A)//˳ľ͵ { ElemType p; for(i=1,j=A.length;i //A.elem[i]<->A.elem[j]; p=A.elem[i]; A.elem[i[=A.elem[j]; A.elem[j]=p; } }//reverse 2.7 ֪ԱL˳洢ṹţֱֲͬд㷨ɾLжԪأʹLûظԪأ1LԪУ(2)LԪطǵݼС . . . void Delete_SameElem(SqLink &L, int L.length){ //ڲѭƶвѭѰͬԪѭ int i=0; int j=i+1; int length=L.length; while(i for(j=i+1;j if(L.Elem[j]==L.Elem[i]){// for(k=j; k j--;//ƶԪغһԪأҪ1 } }//end if If(L.Elem[j]>L.Elem[i]) break;//ڶСӴ˾ }//end for }//end while }//end functoion 2.8 ֪ԱLʽṹšֱֲͬд㷨ɾLֵͬĶԪأʹLûظԪأ(1)LԪУ(2)LԪطǵݼС 1LԪУ ˼·УҪԱÿԪضҪбȽϡ Status ListDeleteLinklist &L//LǴͷԱ { ElemType *p,*q; p==L->next;q=p->next; //趨p仯q仯Ͽ while(p->next){ while(q) { if(p->data!=q->data) q=q->next; else{ q=q->next; p->next=q; }//else }//while p=p->next;q=p->next;//ʼһѰ return OK }//ListDelete . . . (2)LԪطǵݼС ˼·ģһԱ Status ListDelete (LinkList &L) { ElemType *p,*q; p=L->next;q=p->next; while(p->next) { if (p->data!=q->data){ p=p->next; //͵һʲͬط q=p->next; }//if else { while(p->data==q->data) q=q->next;//ظֵ }//else p->next=q;p=q;q=p->next;//ɾֵظĽ㣬Ӧָ return OK }//ListDelete 2.9 ǵݼĵA,Bд㷨AB͵ع鲢һԪֵǵĵ // ϲúĽCУɾB Status ListMergeOppose_L(LinkList &A,LinkList &B,LinkList &C) { LinkList pa,pb,qa,qb; pa=A; pb=B; qa=pa; // paǰָ qb=pb; // pbǰָ pa=pa->next; pb=pb->next; A->next=NULL; C=A; while(pa&&pb){ if(pa->data qa=pa; pa=pa->next; qa->next=A->next; A->next=qa; //ǰСAͷ . .