LeetCode 150. Evaluate Reverse Polish Notation（栈）

Evaluate Reverse Polish Notation

Medium
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

题意

逆波兰表达式求值

思路

用栈存储操作数，遇到操作符("+", “-”, “*”, “/”)则最后两个操作数出栈进行计算，计算结果入栈。最后栈中剩下的唯一元素就是计算结果

代码

class Solution {
    public int evalRPN(String[] tokens) {
        LinkedList<Integer> nums = new LinkedList<Integer>();
        int a = 0, b = 1;
        for (String tok: tokens) {
            if (tok.equals("+") || tok.equals("-") || tok.equals("*") || tok.equals("/")) {
                b = nums.removeLast();
                a = nums.removeLast();
                if (tok.equals("+")) {
                    nums.add(a + b);
                } else if (tok.equals("-")) {
                    nums.add(a - b);
                } else if (tok.equals("*")) {
                    nums.add(a * b);
                } else {
                    nums.add(a / b);
                }
            } else {
                if (tok.charAt(0) == '-') {
                    nums.add(-Integer.parseInt(tok.substring(1)));
                } else {
                    nums.add(Integer.parseInt(tok));
                }
            }
        }
        return nums.isEmpty()? 0: nums.getLast();
    }
}