LWC 60:736. Parse Lisp Expression

LWC 60:736. Parse Lisp Expression

传送门:736. Parse Lisp Expression

Problem:

You are given a string expression representing a Lisp-like expression to return the integer value of. The syntax for these expressions is given as follows. An expression is either an integer, a let-expression, an add-expression, a mult-expression, or an assigned variable. Expressions always evaluate to a single integer. (An integer could be positive or negative.) A let-expression takes the form (let v1 e1 v2 e2 … vn en expr), where let is always the string “let”, then there are 1 or more pairs of alternating variables and expressions, meaning that the first variable v1 is assigned the value of the expression e1, the second variable v2 is assigned the value of the expression e2, and so on sequentially; and then the value of this let-expression is the value of the expression expr. An add-expression takes the form (add e1 e2) where add is always the string “add”, there are always two expressions e1, e2, and this expression evaluates to the addition of the evaluation of e1 and the evaluation of e2. A mult-expression takes the form (mult e1 e2) where mult is always the string “mult”, there are always two expressions e1, e2, and this expression evaluates to the multiplication of the evaluation of e1 and the evaluation of e2. For the purposes of this question, we will use a smaller subset of variable names. A variable starts with a lowercase letter, then zero or more lowercase letters or digits. Additionally for your convenience, the names “add”, “let”, or “mult” are protected and will never be used as variable names. Finally, there is the concept of scope. When an expression of a variable name is evaluated, within the context of that evaluation, the innermost scope (in terms of parentheses) is checked first for the value of that variable, and then outer scopes are checked sequentially. It is guaranteed that every expression is legal. Please see the examples for more details on scope.

Evaluation Examples:

Input: (add 1 2) Output: 3 Input: (mult 3 (add 2 3)) Output: 15 Input: (let x 2 (mult x 5)) Output: 10 Input: (let x 2 (mult x (let x 3 y 4 (add x y)))) Output: 14 Explanation: In the expression (add x y), when checking for the value of the variable x, we check from the innermost scope to the outermost in the context of the variable we are trying to evaluate. Since x = 3 is found first, the value of x is 3. Input: (let x 3 x 2 x) Output: 2 Explanation: Assignment in let statements is processed sequentially. Input: (let x 1 y 2 x (add x y) (add x y)) Output: 5 Explanation: The first (add x y) evaluates as 3, and is assigned to x. The second (add x y) evaluates as 3+2 = 5. Input: (let x 2 (add (let x 3 (let x 4 x)) x)) Output: 6 Explanation: Even though (let x 4 x) has a deeper scope, it is outside the context of the final x in the add-expression. That final x will equal 2. Input: (let a1 3 b2 (add a1 1) b2) Output 4 Explanation: Variable names can contain digits after the first character.

Note:

The given string expression is well formatted: There are no leading or trailing spaces, there is only a single space separating different components of the string, and no space between adjacent parentheses. The expression is guaranteed to be legal and evaluate to an integer.

The length of expression is at most 2000. (It is also non-empty, as that would not be a legal expression.)

The answer and all intermediate calculations of that answer are guaranteed to fit in a 32-bit integer.

思路: 问题的关键在于找出这类问题的一般模式,简单来说,字符串中可以分为【变量】,【值】和【表达式】,而表达式实际上是该问题的子问题,所以我们只需要把变量,值和表达式给解析出来即可。let 有个特点,key和value是一一对应的,而最后一个元素才是对应let的解。在解析key和value的过程中用map存起来,已备后续表达式所用到,为了解决scope的问题,传入到子问题时,都用一份拷贝的map,这样就不会出现map在子问题中被修改,而影响当前到当前的map了。

Java版:

    public int evaluate(String expression) {
        return evaluate(expression, new HashMap<>());
    }

    public int evaluate(String expression, Map<String, Integer> kv) {
        if (expression.charAt(0) == '(') {
            String nstr = expression.substring(1, expression.length() - 1);
            String[] data = nstr.split(" ");
            if (data[0].equals("let")) {
                List<String> splits = parse(expression);
                int n = splits.size();
                for (int i = 0; i < n - 1; i += 2) {
                    kv.put(splits.get(i), evaluate(splits.get(i + 1), clone(kv)));
                }
                return evaluate(splits.get(n - 1), clone(kv)); 
            }
            else if (data[0].equals("add")) {
                List<String> splits = parse(expression);
                return evaluate(splits.get(0), clone(kv)) + evaluate(splits.get(1), clone(kv));
            }
            else {
                List<String> splits = parse(expression);
                return evaluate(splits.get(0), clone(kv)) * evaluate(splits.get(1), clone(kv));
            }
        }
        else {
            if (Character.isDigit(expression.charAt(0)) || expression.charAt(0) == '-') {
                return Integer.parseInt(expression);
            }
            else {
                return kv.get(expression);
            }
        }
    }

    Map<String, Integer> clone(Map<String, Integer> map){
        Map<String, Integer> clone = new HashMap<>();
        for (String key : map.keySet()) clone.put(key, map.get(key));
        return clone;
    }

    List<String> parse(String expression){
        List<String> ans = new ArrayList<>();
        int n = expression.length() - 1;
        char[] exps = expression.toCharArray();
        int j = expression.substring(1, 4).equals("mul") ? 6 : 5;
        while (j < n) {
            if (exps[j] == '(') {
                int lf = 1;
                int i = j + 1;
                for (; i < n; ++i) {
                    if (exps[i] == '(') lf ++;
                    if (exps[i] == ')') {
                        lf --;
                        if (lf == 0) {
                            break;
                        }
                    }
                }
                ans.add(expression.substring(j, i + 1));
                j = i + 2;
            }
            else {
                StringBuilder sb = new StringBuilder();
                while (j < n && exps[j] != ' ') {
                    sb.append(exps[j]);
                    j++;
                }
                j++;
                ans.add(sb.toString());
            }
        }
        return ans;
    }  

本文参与腾讯云自媒体分享计划,欢迎正在阅读的你也加入,一起分享。

发表于

我来说两句

0 条评论
登录 后参与评论

相关文章

来自专栏康怀帅的专栏

PHP 面向对象 抽象类

使用 abstract 关键字申明抽象类和抽象方法。抽象类不能被实例化,只能被其他类继承。 abstract class A { // 抽象方法没有函数...

2846
来自专栏极乐技术社区

使用ES6新特性开发微信小程序(3)——类

Class(类) Class是ES6引入的最重要特性之一。在没有Class之前,我们只能通过原型链来模拟类。 Class Definition(类的定义) cl...

2069
来自专栏数据结构与算法

17:字符串判等

17:字符串判等 总时间限制: 1000ms 内存限制: 65536kB描述 判断两个由大小写字母和空格组成的字符串在忽略大小写,且忽略空格后是否相等。 ...

3609
来自专栏向治洪

Kotlin基础之泛型

泛型 与Java一样,Koltin的类也有类型参数。例如: class Box<T>(t: T){ var value = t } 常规来说,创建这样的...

1837
来自专栏Java帮帮-微信公众号-技术文章全总结

【选择题】Java基础测试七

【选择题】Java基础测试七 86.欲构造ArrayList类的一个实例,此类继承了List接口,下列哪个方法是正确的?( B ) A、ArrayList m...

4993
来自专栏向治洪

Swift基础语法

本文来自Swift中文开发组,感谢翻译者的分享。 本文将分几部分对Swift对iOS的语法做讲解。本文为第一节,主要讲解基础语法。 常量和变量 常量和变量把一个...

1836
来自专栏郭耀华‘s Blog

快速排序法

/** * 快速排序实现 * Created by John Kwok on 2018/2/2. */ import java.util.Arrays; ...

3226
来自专栏Albert陈凯

函数柯里化(Currying)和偏函数应用(部分应用函数)(Partial Application)的比较

【名词解释】Currying:因为是美国数理逻辑学家哈斯凯尔·加里(Haskell Curry)发明了这种函数使用技巧,所以这样用法就以他的名字命名为 Curr...

3485
来自专栏码云1024

C#泛型

2714
来自专栏java学习

Java每日一练(2017/6/15)

题目要求 本期题目: 1、(单选题) What will be printed when you execute the following code? cla...

34010

扫码关注云+社区