public class LISPyunsuan { public static void main(String[] args) { try (Scanner scanner = new Scanner(System.in)) { String remain = scanner.nextLine(); while (remain.contains("(")){ remain=jiexikuohao(remain); System.out.println(remain); } } } private static String jiexikuohao(String remain) { char[] chars = remain.toCharArray(); int zuokuoind = 0; int youkuoind = 0; for (int i = 0; i < chars.length; i++) { //取最右的左括号 if (chars[i] == '(') { zuokuoind = i; } //取最左的右括号 if (chars[i] == ')') { youkuoind = i; break; } } //嵌套最深的括号内 先算 String substring1 = remain.substring(zuokuoind + 1, youkuoind); String[] s1 = su
华为OD题---仿LISP算法
最新推荐文章于 2024-08-05 23:23:35 发布