LeetCode Evaluate Reverse Polish Notation(用栈来计算后缀表达式)

最新推荐文章于 2025-03-19 22:15:53 发布

kgduu

最新推荐文章于 2025-03-19 22:15:53 发布

阅读量753

点赞数

CC 4.0 BY-SA版权

分类专栏： OJ

本文链接：https://blog.youkuaiyun.com/xiexingshishu/article/details/24832923

OJ 专栏收录该内容

986 篇文章

订阅专栏

本文介绍了一种解决逆波兰表达式求值问题的方法。利用栈数据结构处理加减乘除运算，支持整数和表达式作为操作数。示例包括了如何解析和计算简单的逆波兰表达式。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

public class Solution {
    public int evalRPN(String[] tokens) {
        String operators = "+-*/";
        int result = 0;
        
        Stack<String> stack = new Stack<String>();
        
        for (String s: tokens) {
            if (!operators.contains(s)) {
                stack.push(s);
            } else {
                int b = Integer.valueOf(stack.pop());
                int a = Integer.valueOf(stack.pop());
                switch (s) {
                    case "+":
                        stack.push(String.valueOf(a + b));
                        break;
                    case "-":
                        stack.push(String.valueOf(a - b));
                        break;
                    case "*":
                        stack.push(String.valueOf(a * b));
                        break;
                    case "/":
                        stack.push(String.valueOf(a / b));
                        break;
                }
            }
        }
        
        result = Integer.valueOf(stack.pop());
        
        return result;
    }
}