Evaluate Reverse Polish Notation java

最新推荐文章于 2024-10-05 12:07:50 发布

niichang

最新推荐文章于 2024-10-05 12:07:50 发布

阅读量360

点赞数

分类专栏： LeetCode 文章标签： LeetCode Evaluate Reverse Pol java

本文链接：https://blog.csdn.net/niichang/article/details/22943009

版权

LeetCode 专栏收录该内容

0 篇文章 0 订阅

订阅专栏

原题

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

分析：

这一题是计算逆波兰式，遍历表达式，碰到操作数入栈，碰到操作符就从栈顶取出两个操作数，再将计算后的结果入栈，最后栈中剩余的唯一操作数就是计算结果

时间复杂度是O(n)，

空间复杂度是O(n)。

代码：

public class Solution {
    public int evalRPN (String[] tokens) {
        String operators = "+-*/";
        Stack<Integer> stack = new Stack<Integer>();
        for (int i = 0; i < tokens.length; i++) {
            if (operators.contains(tokens[i])) {
                int a = stack.pop();
                int b = stack.pop();
                int index = operators.indexOf(tokens[i]);
                switch (index) {
                case 0:
                    stack.push(a+b);
                    break;
                case 1:
                    stack.push(b-a);
                    break;
                case 2:
                    stack.push(a*b);
                    break;
                case 3:
                    stack.push(b/a);
                    break;
                
                }
            } else {
                stack.push(Integer.parseInt(tokens[i]));
            }
        }
        int value = stack.pop();
        return value;
    }
}