# LWC 60：736. Parse Lisp Expression

## LWC 60：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:

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.

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.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.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++;
}
}
return ans;
}  ```

98 篇文章33 人订阅

0 条评论

## 相关文章

2846

### 使用ES6新特性开发微信小程序（3）——类

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

2069

### 17:字符串判等

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

3609

1837

### 【选择题】Java基础测试七

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

4993

1836

### 快速排序法

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

3226

3485

2714

### Java每日一练（2017/6/15）

34010 