150 Evaluate Reverse Polish Notation

1 题目

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

2 尝试解

class Solution {
public:
    int evalRPN(vector<string>& tokens) {
        int result;
        int num1;
        int num2;
        stack<int> saver;
        vector<string> op {"+","-","*","/"};
        for(int i = 0; i < tokens.size();i++){
            if(count(op.begin(),op.end(),tokens[i]) == 0) {
                saver.push(stoi(tokens[i].c_str()));
                continue;
            }
            num1 = saver.top();
            saver.pop();
            num2 = saver.top();
            saver.pop();
            if(tokens[i] == "+"){
                result = num1 + num2;
            }
            if(tokens[i] == "-"){
                result = num2 - num1;
            }
            if(tokens[i] == "*"){
                result = num1 * num2;
            }
            if(tokens[i] == "/"){
                result = num2 / num1;
            }
            saver.push(result);
        }
        return saver.top();
        
    }
};

3 标准解

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));
            } else {
                int op1 = stack.top();
                stack.pop();
                int op2 = stack.top();
                stack.pop();
                stack.push(map[s](op2, op1));
            }
        }
        return stack.top();
    }
};