evaluate-reverse-polish-notation
2017-06-13 21:40
429 查看
题目描述
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
逆波兰表达式,形式为
(a+b)*c=》
ab+c*
那么ab+c*的执行结果如下: a入栈(0位置); b入栈(1位置); 遇到运算符“+”,将a和b出栈,执行a+b的操作,得到结果d=a+b,再将d入栈(0位置); c入栈(1位置); 遇到运算符“*”,将d和c出栈,执行d*c的操作,得到结果e,再将e入栈(0位置)。
class Solution { public: int str2int(string s) // string转int { int result = 0; int base = 1; int t = 1; // 正负号 if (s[0] == '-') t = -1; for (int i = s.size() - 1; i >= 0; --i) { if (s[i] >= '0' && s[i] <= '9') { result += base * (s[i] - '0'); base *= 10; } } return result * t; } int evalRPN(vector<string> &tokens) { stack<int> k; for (int i = 0; i < tokens.size(); ++i) { if (tokens[i] == "+" || tokens[i] == "-" || tokens[i] == "*" || tokens[i] == "/") { int Num2 = k.top(); // 第一个取出的是右操作数 k.pop(); int Num1 = k.top(); // 左操作数 k.pop(); if (tokens[i] == "+"){ k.push(Num1 + Num2); } else if (tokens[i] == "-"){ k.push(Num1 - Num2); } else if (tokens[i] == "*"){ k.push(Num1 * Num2); } else if (tokens[i] == "/"){ k.push(Num1 / Num2); } } else k.push(str2int(tokens[i])); } return k.top(); // 最后栈剩下一个元素,就是结果 } };
相关文章推荐
- lintcode-medium-Evaluate Reverse Polish Notation
- [LeetCode]题解(python):150-Evaluate Reverse Polish Notation
- 【Leetcode】Evaluate Reverse Polish Notation
- Evaluate Reverse Polish Notation
- LeetCode之EvaluateReversePolishNotation
- leetcode---Evaluate Reverse Polish Notation
- [LeetCode]150.Evaluate Reverse Polish Notation
- leecode 解题总结:150. Evaluate Reverse Polish Notation
- LeetCode题解:Evaluate Reverse Polish Notation
- LeetCode | Evaluate Reverse Polish Notation
- [leetcode]Evaluate Reverse Polish Notation
- 150. Evaluate Reverse Polish Notation
- Evaluate Reverse Polish Notation
- 【LeetCode】Evaluate Reverse Polish Notation
- LeetCode Evaluate Reverse Polish Notation
- Leetcode-Evaluate Reverse Polish Notation-java
- evaluate-reverse-polish-notation java code
- [LeetCode] Evaluate Reverse Polish Notation [2]
- LeetCode第一题:Evaluate Reverse Polish Notation
- 80_leetcode_Evaluate Reverse Polish Notation