LeetCode 150. evaluate-reverse-polish-notation / java

问题描述：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

 

链接：https://www.nowcoder.com/questionTerminal/22f9d7dd89374b6c8289e44237c70447
来源：牛客网

//这道题的核心在于理解题意

import java.util.Stack;
public class Solution {
    public int evalRPN(String[] tokens) {
        Stack<Integer> stack = new Stack<Integer>();
        for(int i = 0;i<tokens.length;i++){
            try{
// 先判断当前字符是不是能够转化为整数，如果可以则入栈，如果不可以，说明遇到了一个符号
// 一旦遇到了符号，就需要取出就近的两个数，拿出来做运算。
// 做完运算后要将当前的结果入栈，切记切记
                int num = Integer.parseInt(tokens[i]);
                stack.add(num);
            }catch (Exception e) {
                int b = stack.pop();
                int a = stack.pop();
                stack.add(get(a, b, tokens[i]));
            }
        }
        return stack.pop();
    }
    private int get(int a,int b,String operator){
        switch (operator) {
        case "+":
            return a+b;
        case "-":
            return a-b;
        case "*":
            return a*b;
        case "/":
            return a/b;
        default:
            return 0;
        }
    }
}