【Leetcode-medium-150】Evaluate Reverse Polish Notation

最新推荐文章于 2022-03-25 16:52:08 发布

LYZ0907

最新推荐文章于 2022-03-25 16:52:08 发布

阅读量879

点赞数 1

分类专栏： Leetcode LeetCode

本文链接：https://blog.csdn.net/liyazhou0215/article/details/78236339

版权

Leetcode 同时被 2 个专栏收录

50 篇文章 2 订阅

订阅专栏

LeetCode

50 篇文章 1 订阅

订阅专栏

【Leetcode-medium-150】Evaluate Reverse Polish Notation

题目

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

思路

栈

程序

import java.util.*;
class Solution {
    public int evalRPN(String[] tokens) {
        if (tokens == null || tokens.length == 0) 
            throw new RuntimeException("illegal argument exception.");
        LinkedList<Integer> stack = new LinkedList<>();
        HashSet<String> set = new HashSet<>();
        set.add("+");
        set.add("-");
        set.add("*");
        set.add("/");

        for (String token : tokens){
            if (set.contains(token)){
                int num2 = Integer.valueOf(stack.pop());
                int num1 = Integer.valueOf(stack.pop());
                switch(token){
                    case "+" : 
                        stack.push(num1 + num2); 
                        break;
                    case "-" :
                        stack.push(num1 - num2);
                        break;
                    case "*" : 
                        stack.push(num1 * num2); 
                        break;
                    case "/" :
                        stack.push(num1 / num2);
                        break;
                }
            }else{
                stack.push(Integer.valueOf(token));
            }
        }
        return stack.peek();
    }
}