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

evaluate-reverse-polish-notation

时间:2017-12-22 15:52:29      阅读:126      评论:0      收藏:0      [点我收藏+]

标签:exp   rand   and   异常   token   operator   def   eval   bsp   

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

这里采用别人使用异常来做判断,这个我个人觉得很厉害。

public int evalRPN(String[] tokens){
        Stack<Integer> stack = new Stack<Integer>();
        for(int i = 0; i<tokens.length;i++){
            try{
                int num = Integer.parseInt(tokens[i]);
                stack.add(num);
            }catch(Exception e){
                int b = stack.pop();
                int a = stack.pop();
                stack.add(get(a,b,tokens[i]));
            }
            
        }
        return stack.pop();
    }
    private int get(int a, int b,String op){
        switch(op){
        case "+":
            return a + b;
        case "-":
            return a - b;
        case "*":
            return a * b;
        case "/":
            return a / b;
        default:
            return 0;
        }
                
    }

 

evaluate-reverse-polish-notation

标签:exp   rand   and   异常   token   operator   def   eval   bsp   

原文地址:http://www.cnblogs.com/LoganChen/p/8086089.html

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