清华考研真题第三章栈与队列

typedef

Elemtype*base[2];Elemtype*top[2];;//{returnOK;Statuspush(BDStacktype&tws,inti,Elemtypex)//x入栈,i=0表示栈,i=1表示高{if(tws.top[0]>tws.top[1returnOVERFLOW注意此时的栈满条件if(i==0)*tws.top[0]++=x;elseif(i==1)*tws.top[1]--elsereturnERROR;returnOK;Statuspop(BDStacktype&tws,inti,Elemtype&x)//x出栈,i=0表示栈,i=1表示高{{if(tws.top[0]==tws.base[0])returnOVERFLOW;}else{if(tws.top[1]==tws.base[1])returnOVERFLOW;}elsereturnERROR;returnOK;{{if(*p=='Hpush(s,*p把'H'存入栈中else*(q++)=*p;//把'S'调到前部}{;//}{{if(StackEmpty(s))return0;if(e!=c)return}if(!StackEmpty(s))returnreturn{{if(*p=='(')elseif(*p==')')count--if(count<0)return}if(countreturnERROR注意括号不匹配的两种情况returnOK;{{else{if(StackEmpty(s))returnERROR;if(*p==')'&&c!='(')returnif(*p==']'&&c!='[')return!='{');//}if(!StackEmpty(s))returnERROR;returnOK;typedefstruct intint}voidRepaint_Color(intg[m][n],inti,intj,intcolor)//把点(i,j)相邻区域的颜色置换为color{{{});//}{});//}{//}{//}voidNiBoLan(char*str,char*new)//str{//InitStack(ss{if(*p是字母*q++=*p;直接输出{if(*p优先级比c高push(s,*p);{{);//}//NiBoLan参见编译原理intGetValue_NiBoLan(char*str)//对逆波兰式求值{p=str;InitStack(ss{if(*p是数push(s,*p);{pute(b,*p,a);假 pop(s,r);returnr;{p=str;Initstack(ssstringtype{{if(*p为字母push(s,*p);{if(StackEmpty(s))returnERROR;if(StackEmpty(s))returnERROR;if(!StackEmpty(s))returnERROR;returnOK;stringtype,对其可以进行连接操作:c=link(a,b).Statusg(intm,intn,int&s)//g{if(m==0&&n>=0)elseif(m>0&&n>=0)s=n+g(m-elsereturnERROR;returnOK;StatusF_recursive(intn,int&s)//{if(n<0)returnERROR;if(n==0)s=n+1;{}returnStatusF_nonrecursive(intn,ints)//{if(n<0)returnERROR;if(n==0)s=n+1;{{InitStack(ssstructinta;intb;}{{}returnfloatSqrt_recursive(floatA,floatp,floate)//{if(abs(p^2-A)<=e)returnelsereturn{return{voidEnCiQueue(CiQueue&Q,intx)//xQ,Q指向队尾元素,Q->next指向头结点,Q->next->next指向队头元素{p->next=Q->next直接把p加在QQ-Q- }StatusDeCiQueue(CiQueue&Q,intx)//Q{if(Q==Q->nextreturnINFEASIBLE;队列已空returnStatusEnCyQueue(CyQueue&Q,intx)//tag{if(Q.front==Q.rear&&Q.tag==1//tag0表示"空",1表示"满"returnOVERFLOW;if(Q.front==Q.rearQ.tag=1;队列满StatusDeCyQueue(CyQueue&Q,int&x)//tag{{if(Q.front==Q.rearQ.tag=1;队列空returnOK;多的空间,较有价值.StatusEnCyQueue(CyQueue&Q,intx)//length{if(Q.length==MAXSIZE)returnOVERFLOW;returnOK;StatusDeCyQueue(CyQueue&Q,int&x)//length{if(Q.length==0)returnhead=(Q.rear-Q.length+1)%MAXSIZE;详见书后注释{{);//}{if(a!=b)returnERROR;}returnvoidGetFib_CyQueue(intk,intn)//kn+1{InitCyQueue(QMAXSIZEkfor(i=0;i<k-1;i++)Q.base[i]=0;Q.base[k-1]=1;//给前k初for(i=0;i<k;i++)printf("%d",Q.base[i]);{;//}{if((Q.rear+1)%MAXSIZE==Q.frontreturnOVERFLOW队列满