码迷,mamicode.com
首页 > 其他好文 > 详细

leetcode[150]Evaluate Reverse Polish Notation

时间:2015-02-09 00:38:04      阅读:247      评论:0      收藏: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.empty())return INT_MIN;
        stack<int> sta;
        for(auto &tok :tokens)
        {
            if(tok!="+"&&tok!="-"&&tok!="*"&&tok!="/")
            {
                sta.push(atoi(tok.c_str()));
            }
            else 
            {
                int right=sta.top();
                sta.pop();
                int left=sta.top();
                sta.pop();
                int res=0;
                switch(tok[0])
                {
                    case +:
                         res=left+right;
                         break;
                    case -:
                         res=left-right;
                         break;
                    case *:
                         res=left*right;
                         break;
                    case /:
                         res=left/right;
                         break;
                    defaut  :break;
                }
                sta.push(res);
            }
        }
        return sta.top();
    }
};

 

leetcode[150]Evaluate Reverse Polish Notation

标签:

原文地址:http://www.cnblogs.com/Vae98Scilence/p/4280724.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!