数据结构之栈解决算术表达式

用栈方式来解决数学表达式：

#include<iostream> 
#include<cstdio>
#include<cstdlib>
#include<cstring> 
#include<stack>
#define MAXSIZE 100
#define Status int 
#define MAXSIZE 100
#define OK 1
#define ERROR 0
using namespace std;

typedef struct Stack{
     char data[MAXSIZE+1];  
     int up;
}LinkStack;



//入栈
int Push(LinkStack &S,char m){
    if(S.up==MAXSIZE)
    return ERROR;
    S.data[++S.up]=m;
    return OK;
}


//出栈
int Pop(LinkStack &S, char &m){
    if(S.up==0) return ERROR;
    m=S.data[S.up];
    S.up--;
    return OK;
} 

char GetTop(LinkStack S){
char a;
a=S.data[S.up];
 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((char)z);  
} 

int precede(char p1,char p2)  
{  
    int flag = -2;  
    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 1 operator!\n");  
               else flag=-1;  
               break;  
    case ')' : if(p2=='(' )printf("error 2 operator!\n");  
               else flag=1;  
               break;  
    case '#' : if(p2==')' )printf("error 3 operator!\n");  
                else if(p2=='#' )   
                    flag=0;  
                else   
                    flag=-1;  
                break;  
    }  
    return(flag);  
}  

double EvaluateExpression(char a[])  
{  
    Stack S1, S2;  
    S1.up = 0;   
    S2.up = 0;  
    double x, y, z;  
    char x1,x2;  
    char r, ch;  
    int I=0;  
    Push(S1,'#');   
    r=a[I];  
    while(r != '#' || GetTop(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(GetTop(S1),r))  
        {  
            case -1:   
                Push(S1,r); r=a[++I]; break; //把运算符放进栈1  
            case 0:  
                Pop(S1,ch);   
                r=a[++I];  
                //r=a[I];  
                break; //弹出一个运算符  
            case 1:   
                Pop(S1, ch); Pop(S2, x1); Pop(S2, x2);  
                Push(S2,operate(ch, x2,x1));  
                //r=a[++I];   
                 r=a[I];  
                break;  
        }  
    }  
    return(GetTop(S2));  
} 
int main()  
{
    int length;
    int t=0;
    char tmp[1000];
    do{
        printf("请输入算术表达式,并以#结束.注意括号的大小写。\n");
    cin>>tmp;
    length=strlen(tmp);
    for(int i=0;i<length;i++){
        if(((tmp[i]>='0')&&(tmp[i]<='9'))||tmp[i]=='+'||tmp[i]=='-'||tmp[i]=='*'||tmp[i]=='/'||tmp[i]=='#')  
//      cout<<tmp[i];
      t=0;
      else if(tmp[length-1]!='#') {
      t=1;continue;}
      else t=1;continue;
    } 
    if(t==1) cout<<"老哥，输入出错了！"<<endl;
}while(t==1);
   if(t==0) {
   double rst = EvaluateExpression(tmp);  
    cout<<"表达式的结果为："<<rst<<endl; 
}
    return 0;  
}