【leetcode】【medium】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.

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

题目链接：https://leetcode-cn.com/problems/evaluate-reverse-polish-notation/

思路

只要看懂题目中逆波拉表达式存储遍历的顺序，利用栈即可完成。

注意几个编程点：

1）string转int的方法：本代码中使用的是c中的函数，还有其他方法，参考这篇博客的总结。

2）做除法时是 后弹出的点/先弹出的点 ，顺序易错。

class Solution {
public:
    int evalRPN(vector<string>& tokens) {
        if(tokens.size()==0) return 0;
        stack<int> record;
        for(int i = 0; i<tokens.size(); ++i){
            if(tokens[i]=="+"||tokens[i]=="-"||tokens[i]=="*"||tokens[i]=="/"){
                assert(tokens.size()>=2);
                int a = record.top();
                record.pop();
                int b = record.top();
                record.pop();
                if(tokens[i]=="+"){
                    b += a;
                }else if(tokens[i]=="-"){
                    b -= a;
                }else if(tokens[i]=="*"){
                    b *= a;
                }else if(tokens[i]=="/"){
                    b /= a;
                }
                record.push(b);
            }else{
                record.push(atoi(tokens[i].c_str()));
            }
        }
        assert(record.size()==1);
        return record.top();
    }
};