【数据结构】后缀表达式算法实现

#include<stack>
#include<string>
#include<iostream>


using namespace std;
void main()
{
stack<double> S;
string m;
cout << "plz input:" << endl;
cin >> m;
int l = m.length();
for (int i = 0; i < l; i++)
{
switch (m[i])
{
case '+':
{double a = S.top();
S.pop();
double b = a + S.top();
S.pop();
S.push(b);
break; }
case '-':
{double a = S.top();
S.pop();
double b = a - S.top();
S.pop();
S.push(b);
break; }
case '*':
{double a = S.top();
S.pop();
double b = a * S.top();
S.pop();
S.push(b);
break; }
case '/':
{double a = S.top();
S.pop();
double b = a / S.top();
S.pop();
S.push(b);
break; }
default://要将数字转换为double并PUSH
double temp = (int)m[i] - 48;
S.push(temp);
break;
}


}
double r = S.top();
S.pop();
if (S.empty())
cout << "answer:" << r << endl;
else
cout << "wrong" << endl;


}