算括号表达式的实现

双栈算数表达式求值的实现方法

#include <iostream> 

#include <string>
#include <stack>
using namespace std;
double Result(const string &expression);


int main()
{
cout << "请输入表达式（不能省略括号）：" << endl;
string s;
getline(cin, s);
cout << "结果是" << Result(s) << endl;
system("pause");
return 0;
}


double Result(const string &expression)
{
stack<double> operands;
stack<char> operators;
string number = "0123456789";
string theOperator = "+-*/";
for (int i = 0; i != expression.size(); i++)
{
if (number.find(expression[i]) != -1)
{
string temp = expression.substr(i, 1);
operands.push(stod(temp));
}
else if (theOperator.find_first_of(expression[i]) != -1)
{
operators.push(expression[i]);
}
else if (expression[i] == ')')
{
double front, behind, sum;
char tempOperator = operators.top();
operators.pop();
front = operands.top();
operands.pop();
behind = operands.top();
operands.pop();
switch (tempOperator)
{
case '+':
sum = front + behind;
break;
case '-':
sum = behind - front;
break;
case '*':
sum = front * behind;
break;
case '/':
sum = behind / front;
break;
}
operands.push(sum);
}
}
return operands.top();
}