[leetcode]evaluate-reverse-polish-notation

最新推荐文章于 2019-08-22 13:14:39 发布

coolwriter

最新推荐文章于 2019-08-22 13:14:39 发布

阅读量130

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/coolwriter/article/details/79960734

版权

leetcode 专栏收录该内容

53 篇文章 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) {
        if(tokens.size() == 0)
            return 0;
        stack<int> st;
        for(int i = 0; i < tokens.size(); ++i)
        {
            string s = tokens[i];
            if(s == "+" || s == "-" || s == "*" || s == "/")
            {
                if(st.size() < 2)
                    return 0;
                int num2 = st.top(); st.pop();
                int num1 = st.top(); st.pop();
                int result = 0;

                if(s == "+")
                    result = num1 + num2;
                else if(s == "-")
                    result = num1 - num2;
                else if(s == "*")
                    result = num1 * num2;
                else if(s == "/")
                    result = num1 / num2;
                st.push(result);
            }
            else
            {
                st.push(atoi(s.c_str()));
            }  
        }
        return st.top();
    }
};