数据结构编程题汇总.docVIP

2.11 Status Insert_SqList(SqList va,int x)//把x插入递增有序表va中{??if(va.length+1va.listsize) return ERROR;??va.length++;??for(i=va.length-1;va.elem[i]xi=0;i--)????va.elem[i+1]=va.elem[i];??va.elem[i+1]=x;??return OK;}//Insert_SqList 2.19 Status Delete_Between(Linklist L,int mink,int maxk)//删除元素递增排列的链表L中值大于mink且小于maxk的所有元素{??p=L;??while(p-next-data=mink) p=p-next; //p是最后一个不大于mink的元素??if(p-next)????//如果还有比mink更大的元素??{????q=p-next;????while(q-datamaxk) q=q-next; //q是第一个不小于maxk的元素????p-next=q;??}}//Delete_Between 2.21 void reverse(SqList A)//顺序表的就地逆置{??for(i=1,j=A.length;ij;i++,j--)????A.elem[i]-A.elem[j];}//reverse 2.22 void LinkList_reverse(Linklist L)//链表的就地逆置;为简化算法,假设表长大于2{??p=L-next;q=p-next;s=q-next;p-next=NULL;??while(s-next)??{????q-next=p;p=q;????q=s;s=s-next; //把L的元素逐个插入新表表头??}??q-next=p;s-next=q;L-next=s;}//LinkList_reverse分析:本算法的思想是,逐个地把L的当前元素q插入新的链表头部,p为新表表头. 2.33 Status LinkList_Divide(LinkList L,CiList A,CiList B,CiList C)//把单链表L的元素按类型分为三个循环链表.CiList为带头结点的单循环链表类型.{??s=L-next;??A=(CiList*)malloc(sizeof(CiLNode));p=A;??B=(CiList*)malloc(sizeof(CiLNode));q=B;??C=(CiList*)malloc(sizeof(CiLNode));r=C; //建立头结点??while(s)??{????if(isalphabet(s-data))????{??????p-next=s;p=s;????}????else if(isdigit(s-data))????{??????q-next=s;q=s;????}????else????{??????r-next=s;r=s;????}??}//while??p-next=A;q-next=B;r-next=C; //完成循环链表}//LinkList_Divide 2.38 DuLNode * Locate_DuList(DuLinkedList L,int x)//带freq域的双向循环??表上的查找{??p=L.next;??while(p.data!=xp!=L) p=p-next;??if(p==L) return NULL; //没找到??p-freq++;q=p-pre;??while(q-freq=p-freqp!=L) q=q-pre; //查找插入位置??if(q!=p-pre)??{????p-pre-next=p-next;p-next-pre=p-pre;????q-next-pre=p;p-next=q-next;????q-next=p;p-pre=q; //调整位置??}??return p;}//Locate_DuList 3.19 Status AllBrackets_Test(char *str)//判别表达式中三种括号是否匹配{??InitStack(s);??for(p=str;*p;p++)??{????if(*p==(||*p==[||*p=={) push(s,*p);????else if(*p==)||*p==]||*p==})????{??????if(StackEmpty(s)) return ERROR