[LeetCode] Evaluate Reverse Polish Notation

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

zjjee

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

阅读量321

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/zjjee/article/details/42007609

版权

LeetCode 专栏收录该内容

131 篇文章 0 订阅

订阅专栏

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

class Solution {
public:
    int evalRPN(vector<string> &tokens) {
        stack<int> s;
        vector<string> ::iterator it = tokens.begin();
        int num1 = 0,num2 = 0;
        while(it != tokens.end()){
            if(*it == "+"||*it == "-" || *it == "*" || *it == "/"){
                num2 = s.top();
                s.pop();
                num1 = s.top();
                s.pop();
                if(*it == "+")
                    s.push(num1 + num2);
                if(*it == "-")
                    s.push(num1 - num2);
                if(*it == "*")
                    s.push(num1 * num2);
                if(*it == "/")
                    s.push(num1 / num2);
            }
            else
                s.push(stoi(*it));
            it ++;
        }
        return s.top();
    }
};