150. Evaluate Reverse Polish Notation

最新推荐文章于 2021-03-20 19:59:28 发布

good-destiny

最新推荐文章于 2021-03-20 19:59:28 发布

阅读量134

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/tuwenqi2013/article/details/97830312

版权

LeetCode 专栏收录该内容

54 篇文章 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) {
         //使用映射，简化了代码
        unordered_map<string, function<int (int, int) > > map = {
            { "+" , [] (int a, int b) { return a + b; } },
            { "-" , [] (int a, int b) { return a - b; } },
            { "*" , [] (int a, int b) { return a * b; } },
            { "/" , [] (int a, int b) { return a / b; } }
        };
        std::stack<int> stack;
        for (string& s : tokens) {
            if (!map.count(s)) {  //判断是否是+-*/
                stack.push(stoi(s));  //stoi 字符串转整形
            } else {
                int op1 = stack.top();
                stack.pop();
                int op2 = stack.top();
                stack.pop();
                stack.push(map[s](op2, op1));
            }
        }
        return stack.top();
    }
};