數(shù)據(jù)結(jié)構(gòu)6次實(shí)驗(yàn)報(bào)告-第三次

}實(shí)驗(yàn)名稱(chēng) 學(xué)號(hào) （2）編程驗(yàn)證作業(yè)三中3.21、3.32的算法實(shí)現(xiàn)（可選#defineADD10typedefstruct{char*base;char*top;intintcreate(stackintpush(stack*s,chare);intpop(stack*s);intempty(stack*s);chargettop(stack*s); intOP(charintprecede(chara,char訂 int{

charc;chare;intn;//chara;原來(lái)出現(xiàn)說(shuō)a/c為未定義的標(biāo)識(shí)符，把定義的位置換了以后可stacks=(stack*)malloc(sizeof(stack));//死在這里了要先push(s,printf("請(qǐng)輸入表達(dá)式，并以#號(hào)結(jié)束c=getchar(while(c!='#'||e!='#')ifOP(cprintf("%c",c);不是運(yùn)算符就打印出else實(shí)驗(yàn)名稱(chēng) 實(shí)驗(yàn) 學(xué)號(hào) n=precede(e,c);//一開(kāi)始用while（recede==1）

}if(n==2)}} return0;訂}線intcreate(stack{s->base=(char*)malloc(SIZE*sizeof(char));if(!s->base)return0;return1;}intpush(stack*s,chars->base=(char*)realloc(s->base,(s->stacksize+ADD)*sizeof(char));if(!s->base)return0;}*s->top++=實(shí)驗(yàn)名稱(chēng) 實(shí)驗(yàn) 學(xué)號(hào) return}intpop(stackif(s->top==s->base)return0;return

}intempty(stackif(s->top==s->base)returnelsereturn}intOP(charif(c=='+'||c=='-'||c=='*'||c=='/'||c=='#')return1;//一開(kāi)始沒(méi)有認(rèn)為“#”號(hào)是符號(hào)elsereturn0;裝} chargettop(stack*s){chare;線returne;}intprecede(chara,charb){if(a=='+'&&(b=='+'||b=='-'||b=='#'))returnif(a=='-'&&(b=='+'||b=='-'||b=='#'))returnif(a=='*'||a=='/')returnif(a=='#'&&b=='#')returnreturn}實(shí)驗(yàn)名稱(chēng) 實(shí)驗(yàn) 學(xué)號(hào) typedefstruct{int*base;intrear;intcreate(Queue*Q,inta);intinsert(Queue*Q,intintaddsum(intn,Queue*Q);intmain(void){inti,j,M,max,temp;Queue*Q=NULL;printf("請(qǐng)輸入斐波那契序 for(i=0;i<M-1;i++)Q-Q->base[M-Q->rear=M-for(i=0;i<=M-1;i++)printf("%d",Q->base[i]);printf("%d",Q->base[Q->rear]);//printf("%d",temp);就會(huì)輸出000124}return0;}實(shí)驗(yàn)名稱(chēng) 實(shí)驗(yàn) 學(xué)號(hào) intcreate(Queue*Q,int{

Q->base=(int*)malloc(a*sizeof(int));if(!Q->base)return0;return1;}intinsert(Queue*Q,int{//if((Q->rear+1)%KQ->front)return0;這句有問(wèn)題應(yīng)該刪掉return}intaddsum(intn,Queue*Q){inti,sum=0;}裝return 三、代碼缺陷及修正記3.1實(shí)驗(yàn)stacks=(stack*)malloc(sizeof(stack));charc;chare;intn;charc;chare;intn;//chara;原來(lái)出現(xiàn)說(shuō)a/c為未定義的標(biāo)識(shí)符，把定義的位置換了以后可stacks=(stack*)malloc(sizeof(stack));//死在這里了實(shí)驗(yàn)名稱(chēng) 實(shí)驗(yàn) 學(xué)號(hào) intOP(charif(c=='+'||c=='-'||c=='*'||c=='/')returnelsereturn

}intOP(charif(c=='+'||c=='-'||c=='*'||c=='/'||c=='#')return1;//一開(kāi)始沒(méi)有認(rèn)為“#”號(hào)是符號(hào)elsereturn0;}3.2實(shí)驗(yàn)printf("%d } 正確語(yǔ)句while(Q->base[Q- printf("%d",Q->base[Q->rear]);//printf("%d",temp);就會(huì)輸出000124}intinsert(Queue*Q,int{if((Q->rear+1)%K==Q->front)return0;return}：林：林intinsert(Queue*Q,int{//if((Q->rear+1)%KQ->front)return0;這句有問(wèn)題應(yīng)該刪掉，然后我就把Q->front一起