Leetcode 150. Evaluate Reverse Polish Notation

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

这道题目考察的是逆波兰式的求解， 拿到这个题目第一反应就是用栈来实现， 遇到数字压栈， 遇到运算符进行计算。

网上还有一种方法是使用递归的方法：
代码如下：

/*
Algorithm: 1) pop string from the end of the vector 2) if it's number, just return it 3) if it's operation, call function recursively for 2nd operand and 1st
/*

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

下面是我们提交的代码：

// 用栈来实现， 遇到数字压栈， 遇到运算符进行计算
class Solution {
public:
    int evalRPN(vector<string>& tokens) {
        stack<int> nums;
        for (auto item : tokens){
            if (item != "+" && item != "-" && item != "*" && item != "/")
                nums.push(stoi(item));
            else{
                int right = nums.top();
                nums.pop();
                int left = nums.top();
                nums.pop();
                int res = oper(item, left, right);
                nums.push(res);
            }
        }
        return nums.top();
    }

private:
    int oper(string op, int left, int right){
        if (op == "+")
            return left + right;
        else if (op == "-")
            return left - right;
        else if (op == "*")
            return left * right;
        else 
            return left / right;
    }
};