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

Evaluate Reverse Polish Notation

时间:2014-07-12 22:43:17      阅读:267      评论: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

public class Solution {
    public int evalRPN(String[] tokens) {
        Stack<String> vals=new Stack<String>();
        Stack<String> ops=new Stack<String>();
        for(int i=0;i<tokens.length;i++){
            if( tokens[i].equals("+") || tokens[i].equals("-") || tokens[i].equals("*") || tokens[i].equals("/")  ){
                ops.push(tokens[i]);
                while(!ops.empty() && !vals.empty()){
                    String op=ops.pop();
                    String val=vals.pop();
                    int d=Integer.parseInt(val);
                    if(op.equals("+")) {
                    	d=Integer.parseInt(vals.pop()) + d;
                    }
                    else if(op.equals("-")){
                    	d=Integer.parseInt(vals.pop()) - d;
                    }
                    else if(op.equals("*")){
                    	d=Integer.parseInt(vals.pop()) * d;
                    }
                    else if(op.equals("/")){
                    	d=Integer.parseInt(vals.pop()) / d;
                    }
                    new String();
					vals.push(String.valueOf(d));
                }
            }
            else{
                vals.push(tokens[i]);
            }
        }
        return Integer.parseInt(vals.pop());
    }
}

Evaluate Reverse Polish Notation,布布扣,bubuko.com

Evaluate Reverse Polish Notation

标签:数据结构   算法   学习   

原文地址:http://blog.csdn.net/dutsoft/article/details/37698321

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