Evaluate Reversed Polish Notation

最新推荐文章于 2017-05-07 22:41:32 发布

gsama

最新推荐文章于 2017-05-07 22:41:32 发布

阅读量383

点赞数

分类专栏： leetcode OJ

本文链接：https://blog.csdn.net/gsama/article/details/24614649

版权

leetcode OJ 专栏收录该内容

27 篇文章 0 订阅

订阅专栏

Evaluate the value of an arithmetic expression in Reverse Polish Notation.

Valid operators are +, -, *, /. Each operand may be an integer or another expression.

wiki explanation for RPN:

http://en.wikipedia.org/wiki/Reverse_Polish_notation

Using Stack

public class Solution {
    public int evalRPN(String[] tokens) {
        //by stack
        //pay attention to minus and divide
        Stack<String> st = new Stack<String>();
        int len = tokens.length;
        int res = 0;
        if(len == 0) return 0;
        if(len == 1) return Integer.parseInt(tokens[0]);
        for(int i=0; i<len; i++){
           if(tokens[i].equals("+") || tokens[i].equals("-") || tokens[i].equals ("*") || tokens[i].equals("/")){
               int a = Integer.parseInt(st.pop());
               int b = Integer.parseInt(st.pop());
               
               if(tokens[i].equals ("+")){
                   st.push(String.valueOf(a+b));
                   
               }
               else if (tokens[i].equals ("-")){
                   st.push(String.valueOf(b-a));       // not a-b
                  
               }
               else if(tokens[i].equals ("*")){
                   st.push(String.valueOf(a*b));
                 
               }
               else if(tokens[i].equals("/")){
                   st.push(String.valueOf(b/a));       // not a/b
                  
               }
           }
           else {
               st.push(tokens[i]);
           }
            
        }
        res = Integer.parseInt(st.pop());
        return res;
    }
}

After searching others' solution, find using switch case is a good choice

Eg: http://www.programcreek.com/2012/12/leetcode-evaluate-reverse-polish-notation/