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 条评论
登录 后参与评论

相关文章

来自专栏机器学习入门

LWC 61:738. Monotone Increasing Digits

LWC 61:738. Monotone Increasing Digits 传送门:738. Monotone Increasing Digits Probl...

1887
来自专栏专注 Java 基础分享

深入理解循环队列----循环数组实现ArrayDeque

     我们知道队列这种数据结构的物理实现方式主要还是两种,一种是链队列(自定义节点类),另一种则是使用数组实现,两者各有优势。此处我们将要介绍的循环队列其实...

2318
来自专栏PHP在线

Array数组函数(一)

array_change_key_case--返回字符串键名全为小写或大写的数组 array_change_key_case(array$input[,...

35814
来自专栏C#

DotNet生成随机数的一些方法

  在项目开发中,一般都会使用到“随机数”,但是在DotNet中的随机数并非真正的随机数,可在一些情况下生成重复的数字,现在总结一下在项目中生成随机数的...

1847
来自专栏desperate633

LeetCode 38. Count and Say题目分析代码

看过去这道题,好像很复杂,其实仔细分析,会发现思路很清晰。不管算第几个数,我们都要从第一个数算起,每个数都要根据前一个数算出来。算数的过程就两个点,一个计算co...

591
来自专栏拂晓风起

java 将数组排序 指这种数组:[] ArrayList之类的请用Collection.sort

921
来自专栏Code_iOS

数据结构:链表

工程代码 Github: Data_Structures_C_Implemention -- Link List

811
来自专栏个人分享

JAVA源码走读(二)二分查找与Arrays类

对数组排序:通过sort方法,按升序。 比较数组:通过equals方法比较数组中元素值是否相等。 查找数组元素:通过binarySearch方法能对排序好的数组...

984
来自专栏Python爬虫与算法进阶

top k frequent words(前K个高频单词)

返回的答案应该按单词出现频率由高到低排序。如果不同的单词有相同出现频率,按字母顺序排序。

1022
来自专栏静默虚空的博客

查找三 哈希表的查找

要点 哈希表和哈希函数 在记录的存储位置和它的关键字之间是建立一个确定的对应关系(映射函数),使每个关键字和一个存储位置能唯一对应。这个映射函数称为哈希函数,根...

2365

扫码关注云+社区