栈&逆波兰150. Evaluate Reverse Polish Notation

最新推荐文章于 2020-11-23 14:56:04 发布

canwang_sjtu

最新推荐文章于 2020-11-23 14:56:04 发布

阅读量190

点赞数

分类专栏： leetcode 文章标签：栈

本文链接：https://blog.csdn.net/canwang_sjtu/article/details/53057795

版权

leetcode 专栏收录该内容

24 篇文章 0 订阅

订阅专栏

这里写图片描述

class Solution {
public:
    int evalRPN(vector<string>& tokens) {
        stack<int> dataStack;

        for (int i=0; i<tokens.size(); ++i)
        {
            int len = tokens[i].size();

            if (len == 1 && !isdigit(tokens[i][0]))// if  token
            {
                int two = dataStack.top(); dataStack.pop();
                int one = dataStack.top(); dataStack.pop();

                switch(tokens[i][0])
                {
                    case '+': dataStack.push(one+two);break;
                    case '-': dataStack.push(one-two);break;
                    case '*': dataStack.push(one*two);break;
                    case '/': dataStack.push(one/two);break;
                }
            }

            else
            {
                int num=0, power = 1;
                if (tokens[i][0] != '-')
                {
                    for (int j=len-1; j>=0; --j)
                    {
                        num += (tokens[i][j] - '0') *power;
                        power*=10;
                    }
                    dataStack.push(num);
                }
                else
                {
                    for (int j=len-1; j>0; --j)
                    {
                        num += (tokens[i][j] - '0') *power;
                        power*=10;
                    }
                    dataStack.push(-num);
                }
            }
        }

        int ans = dataStack.top();
        dataStack.pop();
        return ans;

    }
};