LeetCode 150 Evaluate Reverse Polish Notation

最新推荐文章于 2024-10-01 05:04:32 发布

WANSNIM

最新推荐文章于 2024-10-01 05:04:32 发布

阅读量344

点赞数

分类专栏： *LeetCode 文章标签： leetcode 150 Reverse PolishNota

本文链接：https://blog.csdn.net/Codeblocksm/article/details/71168335

版权

*LeetCode 专栏收录该内容

10 篇文章 0 订阅

订阅专栏

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

将逆波兰式计算结果。难度Medium.

class Solution {
public:
    int evalRPN(vector<string>& tokens) {
        stack<int> sta;
        for(int i = 0; i < tokens.size(); i++)
        {
            string s = tokens[i];
            if(s[s.length()-1] >= '0' && s[s.length()-1] <='9')
            {
                int j =0;
                if(s[0]=='-')  j = 1;
                int num = 0;
                for( ; s[j]; j++)  num = num * 10 + s[j] - '0';
                sta.push(s[0]=='-'? -num :num);
            }
            else
            {
                int opt2 = sta.top(); sta.pop();
                int opt1 = sta.top(); sta.pop();

                if(s[0]=='+') sta.push(opt1 + opt2);
                else if(s[0]=='-') sta.push(opt1 - opt2);
                else if(s[0]=='*') sta.push(opt1 * opt2);
                else sta.push(opt1 / opt2);
            }
        }
        return sta.top();
    }
};