运用栈方法的四则运算法（Four operations algorithm using stack method）.docVIP

运用栈方法的四则运算法（Four operations algorithm using stack method） 算法一 # includes stdio.h # includes math.h # define maxsize 100 typedef struct { double date [maxsize]; int top; } seqstack, * pseqstack 数据栈; / * * / typedef struct { char date1 (maxsize]; int top1; } seqstack1, * pseqstack1 字符栈; / * * / void push (pseqstack d, double x) 入数据栈 {/ * * / s - top + +; s - date [s - top] = x; } double pop (pseqstack d) 出数据栈 {/ * * / double x; x = s - (s - [top]; s - top -. return x; } void destory _ stack (pseqstack * s) 摧毁栈 {/ * * / if (* s) free (* 5); * s = null; return; } void push1 (pseqstack1 d, char x) 入字符栈 {/ * * / s - top1 + +; s - - top1 date1 [d] = x; } char pop1 (pseqstack1 d) 出字符栈 {/ * * / char x; x = s - - top1 date1 [d]. s - top1 - -; return x; } char get _ top (pseqstack1 d) 取字符栈顶 {/ * * / char x; x = s - - top1 date1 [d]. return x; } int isnum (char ch) 判断是否为数字 {/ * * / if (ch = 0 ch = 9) return 1; else return 0; } int priority (char op) 求优先级 {/ * * / switch (po). { houses = : houses). homes is #: return 1; case +: houses -: return 1; case * * *: houses /: return 1; houses (: return 4. } } double calculator (char []) 计算表达式 {/ * * / int i = 0, j; double int _ part = 0, float _ part = 0, x = 0; double c, result, d, b; char ch; pseqstack s = (pseqstack) malloc (sizeof (seqstack)); / * 数据栈 * / pseqstack1 k = (pseqstack1) malloc (sizeof (seqstack1)); / * 运算符栈 * / s - top = - 1. k - top1 = - 1. push1 (k, #). while (a [i]. = = = = | | (ch = get _ top (k)). = #) { if (isnum ([]) 当前字符为数字) / * * / { x = 0, int _ part = 0; float _ part = 0; while (a [i]. =. isnum ([])) { int _ part = int _ part * 10 + [i] - 0. the + +; } j = - 1; if (a [i] = =.) { the + +; while (isnum ([])) { float float _ _ part = part + ([i] (0) * pow (10, j). the + +; j -. } } x = int _ part + float _ part; push (s, x); } 当前字符为运算符 else / * * / if (a [i]. = ) { if ((get _ top (k) = ( [i]. =)) | | priority (get _ top (k) priority (a [i])) {push1 (k, 1); +;} else { if (a [i] = =)