leetcode---evaluate-reverse-polish-notation---栈

最新推荐文章于 2022-03-25 16:52:08 发布

谛听-

最新推荐文章于 2022-03-25 16:52:08 发布

阅读量196

点赞数

分类专栏：题

本文链接：https://blog.csdn.net/u012319493/article/details/78077193

版权

题专栏收录该内容

456 篇文章 1 订阅

订阅专栏

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) 
    {
        int n = tokens.size();
        if(n == 0)
            return 0;
        stack<int> s;
        for(int i=0; i<tokens.size(); i++)
        {
            if(tokens[i] == "+" || tokens[i] == "-" || tokens[i] == "*" || tokens[i] == "/")
            {
                int b = s.top(); s.pop();
                int a = s.top(); s.pop();
                int c = 0;
                if(tokens[i] == "/")
                {
                    if(b != 0)
                        c = a / b;
                } 
                else if(tokens[i] == "*")
                    c = a * b;
                else if(tokens[i] == "-")
                    c = a - b;
                else 
                    c = a + b;
                s.push(c);
            }
            else
            {
                int c = atoi(tokens[i].c_str());
                s.push(c);
            }
        }
        int a = s.top();
        return a;
    }
};