HDU_1237_简单计算器

运算符为+，-,*,/；操作数为整数；且没有括号

设定符号优先级，先在栈底压运算符0

#include<iostream>
#include<cstdio>
#include<cstring>
#include<stack>
using namespace std;

stack<int> op;
stack<double> num;

char input[];

bool prio[][]=
{
    ,,,,,    //
    ,,,,,    //+
    ,,,,,    //-
    ,,,,,    //*
    ,,,,,    //,/
};

void getNext(bool &isOp,int &opNum,int &loc)
{
    if(''<=input[loc]&&input[loc]<='')
    {
        int tmp=;
        while(input[loc]!=' '&&input[loc]!=)
        {
            tmp*=;
            tmp+=input[loc]-'';
            loc++;
        }
        isOp=;
        opNum=tmp;
        if(input[loc]!=)
            loc++;
    }
    else
    {
        isOp=;
        if(input[loc]==)
            opNum=;
        else if(input[loc]=='+')
            opNum=;
        else if(input[loc]=='-')
            opNum=;
        else if(input[loc]=='*')
            opNum=;
        else
            opNum=;
        loc+=;
    }
}

int main()
{
    while(gets(input))
    {
        while(!op.empty())
            op.pop();
        while(!num.empty())
            num.pop();
        if(strlen(input)==&&input[]=='')
            break;
        bool isOp=;
        int opNum=,loc=;
        op.push();
        while(loc<=strlen(input))
        {
            getNext(isOp,opNum,loc);
            if(isOp==)
                num.push(opNum);
            else
            {
                int opTop=op.top();
                if(prio[opNum][opTop]==)
                    op.push(opNum);
                else
                {
                    while(prio[opNum][opTop]==) //这个地方之前出错，当当前运算符优先级比栈顶元素低，应该一直计算至栈顶元素优先级低于当前元素优先级
                    {
                        double num2=num.top();
                        num.pop();
                        double num1=num.top();
                        num.pop();
                        int nowOp=op.top();
                        op.pop();
                        opTop=op.top();
                        if(nowOp==)
                            num.push(num1+num2);
                        else if(nowOp==)
                            num.push(num1-num2);
                        else if(nowOp==)
                            num.push(num1*num2);
                        else if(nowOp==)
                            num.push(num1/num2);
                    }
                    op.push(opNum);
                }
            }
        }
        printf("%.2f\n",num.top());
    }
    return ;
}