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.

Note:

Division between two integers should truncate toward zero.
The given RPN expression is always valid. That means the expression would always evaluate to a result and there won’t be any divide by zero operation.
Example 1:

Input: [“2”, “1”, “+”, “3”, “*”]
Output: 9
Explanation: ((2 + 1) * 3) = 9
Example 2:

Input: [“4”, “13”, “5”, “/”, “+”]
Output: 6
Explanation: (4 + (13 / 5)) = 6
Example 3:

Input: [“10”, “6”, “9”, “3”, “+”, “-11”, “", “/”, "”, “17”, “+”, “5”, “+”]
Output: 22
Explanation:
((10 * (6 / ((9 + 3) * -11))) + 17) + 5
= ((10 * (6 / (12 * -11))) + 17) + 5
= ((10 * (6 / -132)) + 17) + 5
= ((10 * 0) + 17) + 5
= (0 + 17) + 5
= 17 + 5
= 22

题目大意就是指运算符运算他之前的两个数字
思路
利用stack 先进后出，后进先出的特性
一次把数值add如stack，每次碰到符号再把它前两位数字pop出来运算，再把结果添加进去

class Solution {
    public int evalRPN(String[] tokens) {
        
        int a,b;
        Stack<Integer> s = new Stack<>();
        for(String token : tokens){
            
            if(token.equals("+")){
                s.add(s.pop()+ s.pop());
            }
            else if(token.equals("*")){
                s.add(s.pop()* s.pop());
            }
            else if(token.equals("-")){
                b = s.pop(); // 减数
                a= s.pop();// 被减数
                s.add(a-b);
            }
            else if(token.equals("/")){
                b = s.pop(); // 除数
                a= s.pop();// 被除数
                s.add(a/b);
            }
            else{//integer
                s.add(Integer.parseInt(token));
            }
        }
        
        return s.pop();
    }
}