问题:
Evaluate the value of an arithmetic expression in
Reverse Polish Notation
.
Valid operators are +
, -
, *
, /
. Each operand may be an integer or another expression.
Some examples:
["2", "1", "+", "3", "*"] -> ((2 + 1) * 3) -> 9 ["4", "13", "5", "/", "+"] -> (4 + (13 / 5)) -> 6
.思路:问题只有二元操作符,所以所有计算都是先出现左右操作数,再出现操作符。 用栈读取:见到数字就吞入栈中;见到操作符就把栈中的两个数吐出,计算之后再吞入栈中。
class Solution {
public:
int evalRPN(vector<string> &tokens) {
stack<int> s;
int left, right, sum;
for(int i=0;i<tokens.size();i++)
{
string tmp = tokens[i]; //本来想用switch结构的,后来意识到switch结构的表达式结果只能是整型或枚举
if(tmp == "+")
{
right = s.top();
s.pop();
left = s.top();
s.pop();
sum = left + right;
s.push(sum);
}
else if (tmp == "-")
{
right = s.top();
s.pop();
left = s.top();
s.pop();
sum = left - right;
s.push(sum);
}
else if (tmp == "*")
{
right = s.top();
s.pop();
left = s.top();
s.pop();
sum = left * right;
s.push(sum);
}
else if (tmp =="/")
{
right = s.top();
s.pop();
left = s.top();
s.pop();
sum = left / right;
s.push(sum);
}
else
{
sum = stoi(tmp);
s.push(sum);
}
}
return s.top();
}
};