首页 > 代码库 > LeetCode: Evaluate Reverse Polish Notation
LeetCode: Evaluate Reverse Polish Notation
题目: Evaluate Reverse Polish Notation
Evaluatethe 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
简单题,借助一个stack就可以实现,将数值入栈,遇操作符时将两个数值出栈,计算后再入栈,如此即可实现。
int evalRPN(vector<string> &tokens){ stack<int> stokens; for (int i = 0; i < tokens.size(); ++ i) { if (tokens[i] == "+" || tokens[i] == "-" || tokens[i] == "*" || tokens[i] == "/") { int x1 = stokens.top(); stokens.pop(); int x2 = stokens.top(); stokens.pop(); int x3 = caculate(x1, x2, tokens[i]); //计算之后再入栈 stokens.push(x3); } else { stokens.push(atoi(tokens[i].c_str())); } } return stokens.top();}
int caculate(int x1, int x2, string s) { int result; if (s == "+") result = x1 + x2; else if (s == "-") result = x1 - x2; else if (s == "*") result = x1 * x2; else { if (x1 >= x2) result = x1 / x2; else result = x2 / x1; } return result;}
LeetCode: Evaluate Reverse Polish Notation
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。