数据结构-chapter3栈和队列详解.pptVIP

4. C语言程序 file1 #define maxsize 30 typedef struct {char data[maxsize+1]; int top; } Stack; int Push(Stack S, char x) {if (S.top==maxsize) {printf(overflow\n); return(0);} S.data[++S.top]=x; return(1); } int Pop(Stack S, char x) {if(S.top==0){printf(nudertflow\n);return(0)}; x=S.data[S.top]; S.top--; return(1); } file2 char readtop(Stack S) {char a; Pop(S, a); Push(S, a); Return( a); } double operate(char ch, double x, double y) {double z; switch (ch) {case + : z=x+y; break; case - : z=x-y; break; case * : z=x*y; break; case / : z=x/y; break;} return(z);} int precede(char p1,char p2) { int flag; switch (p1) {case + : if(p2==* || p2==/ || p2== ( ) flag=-1; else flag=1; break; case - : if(p2==* || p2==/ || p2== ( ) flag=-1; else flag=1; break; case * : if(p2==( ) flag=-1; else flag=1; break; case / : if(p2==( ) flag=-1; else flag=1; break; case ( : if(p2==)) flag=0; else if(p2==#)printf(error operator!\n); else flag=-1; break; case ) : if(p2==( )printf(error operator!\n); else flag=1; break; case # : if(p2==) )printf(error operator!\n); else if(p2==# ) flag=0; else flag=-1; break;} return(flag);} double calcul(char a[]) {Stack S1, S2; double x, y, z; char r, ch; int i; push(S1,#); r=a[i]; while(r!=# || readtop(S1)!=#) {if(r=9 r=0){ x=0; while(r=9 r=0) {x=x*10+r-0; r=a[++i];} push(S2,x);} else switch(precede(S1,r)) {case -1: push(S1,r); r=a[++i]; break; case 0: pop(S1,ch); r=a[++i]; break; case 1: pop(S1, ch); pop(S2, x1); pop(S2, x2); push(S2, operate(ch, x1.x2)); r=a[++i]; break;}} return(readtop(S2)); } 3.4 队列 (Queue) 一、队列的定义 队列是线性表，通常记为： Q=(a1，a2，a3， …，ai，…，an) 它只允许在表尾进行