1、求解原理:
遇到操作数,放入栈中,遇到操作符,从栈中取两个操作数计算,计算的结果再放入栈中
2、为什么不将操作数放入字符串中?
因为挨着放,例如:“12345”,不知道是1、2、3、4、5,还是12345或者y也可以在字符串中加入逗号,例如“1,2,3,4,5”
3.逆波兰表达式求值程序
定义枚举:enum Type
{
OP_NUM,
OP_SYMBOL,
ADD,
SUB,
MUL,
DIV
};
核心代码:
struct Cell
{
Type _type;
int _num;
};
int RPNCount(Cell a[], size_t size)
{
stack<int> s;
for (size_t i = 0; i < size; ++i)
{
if (a[i]._type == OP_NUM)
{
s.push(a[i]._num);
}
else
{
int right = s.top();
int left = s.top();
switch (a[i]._num)
{
case ADD:
{
s.push(left + right);
break;
}
case SUB:
{
s.push(left - right);
break;
}
case MUL:
{
s.push(left*right);
break;
}
case DIV:
{
s.push(left / right);
break;
}
default:
{
cout << "Invalid OP_SYMBOL" << endl;
exit(-1);
break;
}
}
}
}
return s.top();
}
测试用例:
void Test()
{
Cell RPNArray[]=
{
{ OP_NUM, 12 },
{ OP_NUM, 3 },
{ OP_NUM, 4 },
{ OP_SYMBOL, ADD },
{ OP_SYMBOL, MUL },
{OP_NUM,6},
{OP_SYMBOL,MUL},
{OP_SYMBOL,SUB},
{OP_NUM,8},
{OP_NUM,2},
{OP_SYMBOL,DIV},
{OP_SYMBOL,ADD}
};
cout << RPNCount(RPNArray, sizeof(RPNArray) / sizeof(Cell)) << endl;
}