首页 > 其他 > 详细

leetcode——Evaluate Reverse Polish Notation 求算式值(AC)

时间:2016-01-12 13:48:19      阅读:162      评论: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) {
        stack<int> myStack;
        int first,second,merge;
        for(int i=0; i<tokens.size(); i++)
        {
            if(tokens[i]=="+" || tokens[i]=="-" || tokens[i]=="*" || tokens[i]=="/")
            {
                first = myStack.top();
                myStack.pop();
                second = myStack.top();
                myStack.pop();
                if(tokens[i] == "+")
                    merge = first + second;
                else if(tokens[i] == "-")
                    merge = second - first;
                else if(tokens[i] == "*")
                    merge = first * second;
                else if(tokens[i] == "/")
                    merge = second / first;
            }
            else
            {
                merge = atoi(tokens[i].c_str());
            }
            myStack.push(merge);
        }
        return myStack.top();
    }
};




leetcode——Evaluate Reverse Polish Notation 求算式值(AC)

原文:http://www.cnblogs.com/mengfanrong/p/5123942.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!