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
解决方案1:
import java.util.Stack;
public class Solution {
 	 Stack<Integer> s=new Stack<Integer>();
    public int evalRPN(String[] tokens) {
        String ch;
        Integer newoperand;
        for(int i=0;i<tokens.length;i++)
            {
            ch=tokens[i];
            switch(ch){
                case "+":
                case "-":
                case "*":
                case "/":
                    Dooperator(ch);break;
                default: newoperand=Integer.parseInt(ch);
                    s.add(newoperand);
                    
            }
        }
        return s.pop();
    
    }
    public void Dooperator(String ch)
    {int value;
    	int a=s.pop();
    	int b=s.pop();
    	switch(ch){
    	case "+":value=b+a;s.push(value);break;
    	case "-":value=b-a;s.push(value);break;
    	case "*":value=b*a;s.push(value);break;
    	case "/":value=b/a;s.push(value);break;
    	}
    }

方案二(较新颖):

链接:https://www.nowcoder.com/questionTerminal/22f9d7dd89374b6c8289e44237c70447
来源:牛客网

import java.util.Stack;
public class Solution {
    public int evalRPN(String[] tokens) {
        Stack<Integer> stack = new Stack<Integer>();
        for(int i = 0;i<tokens.length;i++){
            try{
                int num = Integer.parseInt(tokens[i]);
                stack.add(num);
            }catch (Exception e) {
                int b = stack.pop();
                int a = stack.pop();
                stack.add(get(a, b, tokens[i]));
            }
        }
        return stack.pop();
    }
    private int get(int a,int b,String operator){
        switch (operator) {
        case "+":
            return a+b;
        case "-":
            return a-b;
        case "*":
            return a*b;
        case "/":
            return a/b;
        default:
            return 0;
        }
    }
}



  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值