LeetCode 0150 - Evaluate Reverse Polish Notation

Reck Zhang

发布于 2021-08-11 14:48:50

21700

代码可运行

文章被收录于专栏：Reck ZhangReck Zhang

运行总次数：0

代码可运行

Evaluate Reverse Polish Notation

Desicription

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

Solution

class Solution {
public:
    int evalRPN(vector<string>& tokens) {
        string s = tokens.back();
        tokens.pop_back();
        if(s == "*" || s == "/" || s == "+" || s == "-") {
            int r2 = evalRPN(tokens);
            int r1 = evalRPN(tokens);
            if(s == "*")
                return r1 * r2;
            else if(s == "/")
                return r1 / r2;
            else if(s == "+")
                return r1 + r2;
            else if(s == "-")
                return r1 - r2;
        }
        else
            return atoi(s.c_str());
    }
};

本文参与腾讯云自媒体同步曝光计划，分享自作者个人站点/博客。

原始发表：2018-05-29，如有侵权请联系 cloudcommunity@tencent.com 删除

division