LeetCode 150. 逆波兰表达式求值

题目描述

根据逆波兰表示法，求表达式的值。
有效的运算符包括 +, -, *, / 。每个运算对象可以是整数，也可以是另一个逆波兰表达式。

整数除法只保留整数部分。 给定逆波兰表达式总是有效的。
换句话说，表达式总会得出有效数值且不存在除数为 0 的情况。

示例 1：
输入:[“2”, “1”, “+”, “3”, “*”]
输出: 9
解释: ((2 + 1) * 3) = 9

示例 2：
输入: [“4”, “13”, “5”, “/”, “+”]
输出: 6
解释: (4 + (13 / 5)) = 6

示例 3：
输入: [“10”, “6”, “9”, “3”, “+”, “-11”, “", “/”, "”, “17”, “+”, “5”, “+”]
输出: 22
解释:
((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

解题思路

• 逆波兰表达式求值：遍历tokens，利用栈先入后出的特点，遍历到数字就入栈，遍历到运算符就取出栈顶的两个元素进行运算，再把运算的结果入栈
• 注：取出栈顶的两个元素，第一个用来做右操作数，第二个用来做左操作数

Python实现

class Solution:
    def evalRPN(self, tokens: List[str]) -> int:
        symbol = ["+","-","*","/"]
        stack = []
        if len(tokens) <= 0:
            return 0
        else:
            for c in tokens:
                if c not in symbol:
                    stack.append(c)
                else:
                    right = int(stack.pop())
                    left = int(stack.pop())
                    if c == "+":
                        stack.append(left + right)
                    elif c == "-":
                        stack.append(left - right)
                    elif c == "*":
                        stack.append(left * right)
                    else:
                        stack.append(int(left / right))
                res = int(stack[0])
            return res 

优化代码

class Solution:
    def evalRPN(self, tokens: List[str]) -> int:
        stack=[]
        for c in tokens:
            if c == '+':
                stack.append(stack.pop() + stack.pop())
            elif c == '-':
                right = stack.pop()
                left = stack.pop()
                stack.append(left - right)
            elif c == '*':
                stack.append(stack.pop() * stack.pop())
            elif c == '/':
                right = stack.pop()
                left = stack.pop()
                stack.append(int(left / right))
            else:
                stack.append(int(c))
        return stack[0]

• 时间复杂度：O(n)

Java实现

    public int evalRPN(String[] tokens) {
        Stack<Integer> stack = new Stack<>();
        Integer num1, num2;
        for (String s : tokens) {
            switch (s) {
                case "+":
                    num1 = stack.pop();
                    num2 = stack.pop();
                    stack.push(num1 + num2);
                    break;
                case "-":
                    num1 = stack.pop();
                    num2 = stack.pop();
                    stack.push(num2 - num1);
                    break;
                case "*":
                    num1 = stack.pop();
                    num2 = stack.pop();
                    stack.push(num1 * num2);
                    break;
                case "/":
                    num1 = stack.pop();
                    num2 = stack.pop();
                    stack.push(num2 / num1);
                    break;
                default:
                    stack.push(Integer.parseInt(s));
            }
        }
        return stack.peek();
    }