仿lisp运算 java_华为机试题:仿LISP

packagecom.nowcoder.huawei;import java.util.*;public classLISP {//只通过80%//(+ (* 2 3) (^ 4))//(+ (* 2 3) (^ 4))(2 3)//((+ 2 3)//((+ 2 3))//(^ (+ (* 2 3) (^ ((^ 4)))))

public static voidmain(String[] args) {

Scanner scanner= newScanner(System.in);

String express=scanner.nextLine();

Stack stack = new Stack<>();for (int i = 0; i < express.length(); i++) {char c =express.charAt(i);if (c == ‘)‘) {

StringBuilder builder= newStringBuilder();chartop;while (!stack.empty() &&(top = stack.pop()) != ‘(‘) {

builder.append(top);

}

String currExp=builder.reverse().toString();//System.out.println(currExp);

String[] ops= currExp.split(" ");if (ops.length == 2) {int value = Integer.valueOf(ops[1]);

value++;

String count=String.valueOf(value);for (int j = 0; j < count.length(); j++) {

stack.push(count.charAt(j));

}

}else if (ops.length == 3) {int a = Integer.valueOf(ops[1]);int b = Integer.valueOf(ops[2]);int value = 0;switch (ops[0]) {case "+":

value= a +b;break;case "*":

value= a *b;break;

}

String count=String.valueOf(value);for (int j = 0; j < count.length(); j++) {

stack.push(count.charAt(j));

}

}else if (ops.length == 1) {for (int j = 0; j < ops[0].length(); j++) {

stack.push(ops[0].charAt(j));

}

}

}else{

stack.push(c);

}

}

StringBuilder builder= newStringBuilder();while (!stack.empty())

builder.append(stack.pop());try{

System.out.println(Integer.valueOf(builder.reverse().toString()));

}catch(Exception e) {

System.out.println(-1);

}

}

}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值