736 Parse Lisp Expression

736. Parse Lisp Expression

1. Question

You are given a stringexpressionrepresenting 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), whereletis always the string"let"

, then there are 1 or more pairs of alternating variables and expressions, meaning that the first variablev1is assigned the value of the expressione1, the second variablev2is assigned the value of the expressione2, and so on sequentially; and then the value of this let-expression is the value of the expressionexpr.

An add-expression takes the form(add e1 e2)whereaddis always the string"add", there are always two expressions

e1, e2, and this expression evaluates to the addition of the evaluation ofe1and the evaluation ofe2.

A mult-expression takes the form(mult e1 e2)wheremultis always the string"mult", there are always two expressions

e1, e2, and this expression evaluates to the multiplication of the evaluation ofe1and the evaluation ofe2.

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 stringexpressionis 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 ofexpressionis 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.

2. Implementation

(1) Recursion

class Solution {
    public int evaluate(String expression) {
        Map<String, Integer> map = new HashMap();
        return eval(expression, map);
    }

    public int eval(String expression, Map<String, Integer> parent) {
        if (expression.charAt(0) != '(') {
            if (expression.charAt(0) == '-' || Character.isDigit(expression.charAt(0))) {
                return Integer.parseInt(expression);
            }
            else {
                return parent.get(expression);
            }
        }
        Map<String, Integer> map = new HashMap();
        map.putAll(parent);

        int offset = expression.charAt(1) == 'm' ? 6 : 5;

        List<String> tokens = parse(expression.substring(offset, expression.length() - 1));

        if (expression.startsWith("(add")) {
            return eval(tokens.get(0), map) + eval(tokens.get(1), map);
        }
        else if (expression.startsWith("(mult")) {
            return eval(tokens.get(0), map) * eval(tokens.get(1), map);
        }
        else {
            for (int i = 0; i < tokens.size() - 2; i += 2) {
                map.put(tokens.get(i), eval(tokens.get(i + 1), map));
            }
            return eval(tokens.get(tokens.size() - 1), map);
        }
    }

    public List<String> parse(String s) {
        List<String> res = new ArrayList();
        StringBuilder sb = new StringBuilder();
        int count = 0;

        for (char c : s.toCharArray()) {
            if (c == '(') {
                ++count;
            }
            if (c == ')') {
                --count;
            }

            if (count == 0 && c == ' ') {
                res.add(sb.toString());
                sb = new StringBuilder();
            }
            else {
                sb.append(c);
            }
        }

        if (sb.length() > 0) {
            res.add(sb.toString());
        }
        return res;
    }
}

3. Time & Space Complexity

Recursion: 时间复杂度O(n), 空间复杂度O(n), 递归深度取决于嵌套表达式的个数