150. Evaluate Reverse Polish Notation**

最新推荐文章于 2019-03-02 02:53:29 发布

Yingying_code

最新推荐文章于 2019-03-02 02:53:29 发布

阅读量290

点赞数

分类专栏： leetcode Java Stack

本文链接：https://blog.csdn.net/alwaystry/article/details/53730553

版权

leetcode 同时被 3 个专栏收录

261 篇文章 0 订阅

订阅专栏

Java

188 篇文章 0 订阅

订阅专栏

Stack

12 篇文章 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

My code:

public class Solution {
    public int evalRPN(String[] tokens) {
        Stack<String> stack = new Stack<>();
        for(String str:tokens){
            if(str.equals("+")||str.equals("-")||str.equals("*")||str.equals("/")){
                int op2 = stack.pop();
                int op1 = stack.pop();
                if(op.equals('+')) stack.push(op1+op2);
                else if (op.equals('-')) stack.push(op1-op2);
                else if (op.equals('*')) stack.push(op1*op2);
                else stack.push(op1/op2);
            }
            else{
                stack.push(Integer.parseInt(str));
            }
        }
  

    }
}

怎么就不对呢