LeetCode|Evaluate Reverse Polish Notation

最新推荐文章于 2020-03-04 16:52:16 发布

DouMiaoO_Oo

最新推荐文章于 2020-03-04 16:52:16 发布

阅读量320

点赞数

分类专栏：数据结构 | 算法 LeetCode 文章标签： leetcode 逆波兰表达式 stack

本文链接：https://blog.csdn.net/DouMiaoO_Oo/article/details/51295087

版权

LeetCode 同时被 2 个专栏收录

73 篇文章 0 订阅

订阅专栏

数据结构 | 算法

49 篇文章 0 订阅

订阅专栏

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
  ["4", "13", "5", "/", "+"] -> (4 + (13 / 5)) -> 6

class Solution {
public:
    int evalRPN(vector<string>& tokens) {
        stack<int> s;
        for(int i = 0; i < tokens.size(); i++){
            if(tokens[i].length() == 1 && (tokens[i][0] < '0' || tokens[i][0] > '9')){
                int y = s.top();
                s.pop();
                int x = s.top();
                s.pop();
                switch(tokens[i][0]){  // 类和结构体不能用switch做分支比较 
                    case '+': s.push(x+y);break;
                    case '-': s.push(x-y);break;
                    case '*': s.push(x*y);break;  
                    case '/': s.push(x/y);break;   // ["0","3","/"]
                }
            } else {
                int num = 0;
                int j = 0;
                int flag = 1;
                if(tokens[i][0] == '+') {j++;}
                else if(tokens[i][0] == '-') {j++;flag = -1;}

                for(; j < tokens[i].length(); j++){
                    num = num*10 + tokens[i][j]-'0';
                } s.push(flag*num);
            }
        } return s.top();
    }

};