赵二的刷题日记036《逆波兰表达式》

Evaluate Reverse Polish Notation

Evaluate the value of an arithmetic expression in Reverse Polish Notation.

Valid operators are +, -, *, and /. Each operand may be an integer or another expression.

Note that division between two integers should truncate toward zero.

It is guaranteed that the given RPN expression is always valid. That means the expression would always evaluate to a result, and there will not be any division by zero operation.

Example 1:

Input: tokens = ["2","1","+","3","*"]
Output: 9
Explanation: ((2 + 1) * 3) = 9

Example 2:

Input: tokens = ["4","13","5","/","+"]
Output: 6
Explanation: (4 + (13 / 5)) = 6

Example 3:

Input: tokens = ["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

class Solution {
    public int evalRPN(String[] tokens) {
        //创建一个栈用于保存数字
        //如果扫描到数字，就压进栈
        //如果扫描到操作符，就弹出俩数进行运算
        //将运算后的结果在压进栈
        Stack<Integer> num = new Stack<>();
        int sum = 0;
        int b = 0;
        int a = 0;
        
        for (String s : tokens) {
            // System.out.println(s);
            if (s.equals("+")) {
                b = num.pop();
                a = num.pop();
                sum = a + b;
                num.push(sum);
            } else if (s.equals("-")) {
                b = num.pop();
                a = num.pop();
                sum = a - b;
                num.push(sum);
            } else if (s.equals("*")) {
                b = num.pop();
                a = num.pop();
                sum = a * b;
                num.push(sum);
            } else if (s.equals("/")) {
                b = num.pop();
                a = num.pop();
                if (b == 0) {
                    return -1;
                }
                sum = a / b;
                num.push(sum);
            } else {
                int n = Integer.parseInt(s);
                num.push(n);
            }
            
        }
        //还可能只放进一个数，那就返回这个数
        if (!num.isEmpty())
            return num.pop();
        return sum;
    }
}