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<>();
        for (int i = 0; i < tokens.length; i++) {
            String str = tokens[i];
            //注意哪个是第一个，哪个是第二个
            switch(str) {
                case "+": 
                    stack.push(stack.pop() + stack.pop());
                    break;
                case "-":
                    stack.push(0 - stack.pop() + stack.pop());
                    break;
                case "*":
                    stack.push(stack.pop() * stack.pop());
                    break;
                case "/":
                    int num2 = stack.pop();
                    int num1 = stack.pop();
                    stack.push(num1 / num2);
                    break;
                default:
                    stack.push(Integer.valueOf(str));
                    //stack.push(Integer.parseInt(str));
                    break;
            }
        }
        return stack.pop();
    }
}