
遇到运算符将栈底两个元素弹出,进行计算
class Solution {
public:
int evalRPN(vector<string>& tokens) {
stack<int> stk;
int n = tokens.size();
for (int i = 0; i < n; i++) {
string& token = tokens[i];
if (isNumber(token)) {
stk.push(atoi(token.c_str()));
} else {
int num2 = stk.top();
stk.pop();
int num1 = stk.top();
stk.pop();
switch (token[0]) {
case ‘+‘:
stk.push(num1 + num2);
break;
case ‘-‘:
stk.push(num1 - num2);
break;
case ‘*‘:
stk.push(num1 * num2);
break;
case ‘/‘:
stk.push(num1 / num2);
break;
}
}
}
return stk.top();
}
bool isNumber(string& token) {
return !(token == "+" || token == "-" || token == "*" || token == "/");
}
};
Evaluate Reverse Polish Notation
原文:https://www.cnblogs.com/zhangdalao/p/14645317.html