Evaluate Reverse Polish Notation

最新推荐文章于 2020-01-11 07:14:04 发布

张荣华_csdn

最新推荐文章于 2020-01-11 07:14:04 发布

阅读量174

点赞数

分类专栏： leetcode 栈文章标签： Evaluate Reverse Polish Notati leetcode 逆波兰表达式

本文链接：https://blog.csdn.net/zrh_CSDN/article/details/80855164

版权

leetcode 同时被 2 个专栏收录

211 篇文章 2 订阅

订阅专栏

栈

29 篇文章 0 订阅

订阅专栏

Evaluate the value of an arithmetic expression in Reverse Polish Notation.

Valid operators are +, -, *, /. Each operand may be an integer or another expression.

Note:

Division between two integers should truncate toward zero.
The given RPN expression is always valid. That means the expression would always evaluate to a result and there won't be any divide by zero operation.

Example 1:

Input: ["2", "1", "+", "3", "*"]
Output: 9
Explanation: ((2 + 1) * 3) = 9

Example 2:

Input: ["4", "13", "5", "/", "+"]
Output: 6
Explanation: (4 + (13 / 5)) = 6

Example 3:

Input: ["10", "6", "9", "3", "+", "-11", "*", "/", "*", "17", "+", "5", "+"]
Output: 22
Explanation: 
  ((10 * (6 / ((9 + 3) * -11))) + 17) + 5
= ((10 * (6 / (12 * -11))) + 17) + 5
= ((10 * (6 / -132)) + 17) + 5
= ((10 * 0) + 17) + 5
= (0 + 17) + 5
= 17 + 5
= 22

class Solution {
public:
int evalRPN(vector<string>& tokens) {
if(tokens.size() == 0)
return 0;
stack<int> st;
for(int i = 0; i < tokens.size(); ++i)
{
string s = tokens[i];
if(s == "+" || s == "-" || s == "*" || s == "/")
{
if(st.size() < 2)
return 0;
int num2 = st.top();
st.pop();
int num1 = st.top();
st.pop();
int result=0;
if(s == "+")
result = num1 + num2;
else if(s == "-")
result = num1 - num2;
else if(s == "*")
result = num1 * num2;
else if(s == "/")
result = num1 / num2;
st.push(result);
}
else
st.push(stoi(s));
}
return st.top();
}
};