HDU - 1237

读入一个只包含 +, -, *, / 的非负整数计算表达式,计算该表达式的值。 
Input测试输入包含若干测试用例,每个测试用例占一行,每行不超过200个字符,整数和运算符之间用一个空格分隔。没有非法表达式。当一行中只有0时输入结束,相应的结果不要输出。 
Output对每个测试用例输出1行,即该表达式的值,精确到小数点后2位。 
Sample Input
1 + 2
4 + 2 * 5 - 7 / 11
0
Sample Output
3.00
13.36
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;
int main()
{
    string s;
    int flag;
    while(getline(cin,s))
    {
        if(s.size()==1)break;
        flag = 1;
        stringstream stream(s);
        double num;
        char op = ' ';
        stack sop;
        stack snum;
        while(1)
        {
            if(flag)
            {
               stream >> num;
                if(op =='*'||op == '/')
                {
                    double num1 = snum.top();
                    snum.pop();
                    if(op=='*')
						num1 = num * num1;
                    else
						num1 = num1 / num;
                    snum.push(num1);
                }
                else 
					snum.push(num);
                flag=0;
            }
            else
            {
                if(stream>>op);
                else break;
                if(op=='+'||op=='-')
                {
                    double num1,num2;
                    char c;
                    if(!sop.empty())
                    {
                        c=sop.top(),sop.pop();
                        num2=snum.top(),snum.pop();
                        num1=snum.top(),snum.pop();
                        if(c=='+')num1+=num2;
                        else num1-=num2;
                        snum.push(num1);
                    }
                    sop.push(op);
                }
                flag=1;
            }
        }
        while(!sop.empty())
        {
            op=sop.top(),sop.pop();
            double num1,num2;
            num2=snum.top(),snum.pop();
            num1=snum.top(),snum.pop();
            if(op=='+')
				num1+=num2;
            else 
				num1-=num2;
            snum.push(num1);
        }
        printf("%.2lf\n",snum.top());
    }
    return 0;
}

#include
#include
#include
#include
#include
#include
#include
using namespace std;
int main() 
{	
	char op;
	double num,temp;
	while(scanf("%lf",&num))
	{
		stack sum;
		op = getchar();
		if(num == 0 && op == '\n')break;
		sum.push(num);
		while(1)
		{
			scanf("%c %lf", &op, &num);
			switch (op)
			{
			case '+':
				sum.push(num);
				break;
			case '-':
				sum.push(-num);
				break;
			case '*':
				temp = sum.top();
				sum.pop();
				sum.push(temp*num);
				break;
			case '/':
				temp = sum.top();
				sum.pop();
				sum.push(temp/num);
				break;
			}
			if(getchar() == '\n')break;
		}
		double ans = 0;
		while(!sum.empty())
		{
			ans += sum.top();
			sum.pop();
		}
		printf("%.2lf\n",ans);
	}

		
}

你可能感兴趣的:(数据结构)