数据结构代码.docxVIP

#includestdio.h#includestdlib.h #includestring.h typedef struct( char op; int level;JOpNode; typedef struct( OpNode op[100]; int top;} stack; void init(stack *st)( st-top=0;) OpNode pop(stack *a){ if (a-top==0) return a-op[—(a-top)];) void push(stack *a,OpNode op)( a-op[(a-top)++]=op;) OpNode top(stack *a)( if (a-top==0) return a-op[(a-top)-l];) typedef struct( double num[100]; int top;} numstack; void init2(numstack *st) st-top=0;double pop2(numstack *a) if (a-top==0) ( return(-l); ) a-top; return a-num[a-top];) void push2(numstack ^a,double num)( a-num[(a-top)++]=num;) void main() ( void change (char str[],char exp[]); double CalResult(char exp[]); double Directcalresult(char str[]); char str[100],exp[100]; printf(算术表达式为:\n); gets(str); change(str,exp); gets(exp); printf(后缀表达式为:％s\n”,exp); printf(运算结果为：%f\nH ,CalResul t(exp)); printf(直接运算的结果为:%f\n ,Directcalresult(str));void change (char str[],char ch[]) ( int i=0; int k=0; char c; stack st; OpNode op; OpNode ops; init(st); c=str[i++]; while (c!=\0)if ((c=Oc=9)||c==.) while ((c=0c=,9,)||c==1.)ch[k++]=c; c=str[i++];) ch[k++]=T;) if(c==()( op.op-(;op.level=-l; push(st,op);) if(c=)){ op=top(st);while (st.top! =0op.op!=,() (op=pop(st); chfk++]=op.op;if (st.top0) op=top(st); else break;) pop(st);} if(c==Tc=?)( op.op=c;op.level=l; if (st.top==0)( push(st,op);/) else( ops=top(st);while (ops.level=op.level)( ops=pop(st);ch[k++]=ops.op; if (st.top0) ops=top(st);else break;push(st,op); )) if(c==^f||c==7,||c==,%)( op.op=c;op.level=2; if (st.top==0) (push(st,op); ) else ( ops=top(st);while (ops.level=op.level) ( ops=pop(st); ch[k++]=ops.op;if (st.top0) ops=top(st); else break; ) push(st,op);) ) c=strfi++]; ) while(st.top!=0)( ops=pop(st); ch[k++]=ops.op; ) ch[k]=\O;double CalResult(char exp[]) ( char c;numstack numst; double dl,d2,dr;int k=0; int i=0;char *s; char transflOO];init2 (numst); c=exp[k++];while (c!=0‘) (if(c=-+||c==-,||c=-*|||c==7|||c=-%1) {switch(c) (case: d2=pop2(numst);d 1 =pop2(numst); dr=dl+d2; push2(numst,d