leetcode 150.Evaluate Reverse Polish Notation

一 .题目

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(String[] tokens) {
        Stack<Integer> stack = new Stack<Integer>();
        int a = 0 , b = 0;
        for(String s : tokens){
            if(s.equals("+")){
                stack.push(stack.pop() + stack.pop());
            }else if(s.equals("-")){
                a = stack.pop();
                b = stack.pop();
                stack.push(b - a);
            }else if(s.equals("*")){
                a = stack.pop();
	            b = stack.pop();
	            stack.push(a * b);
	        }else if(s.equals("/")){
	            a = stack.pop();
	            b = stack.pop();
	            stack.push(b/a);
	        }else{
	            stack.push(Integer.parseInt(s));
	    }
    }
        return stack.pop();
    }
}