LeetCode每日一题：385. 迷你语法分析器

385. 迷你语法分析器

这道题是一个嵌套列表，如果一个函数可以处理一个列表，那么我们就可以递归调用这个函数。
那么这个函数首先处理列表左右括号，再处理中间的部分，中间的数字通过stoi添加到$NestedInteger$中，为了统一指针可以使用引用传值。

/**
 * // This is the interface that allows for creating nested lists.
 * // You should not implement it, or speculate about its implementation
 * class NestedInteger {
 *   public:
 *     // Constructor initializes an empty nested list.
 *     NestedInteger();
 *
 *     // Constructor initializes a single integer.
 *     NestedInteger(int value);
 *
 *     // Return true if this NestedInteger holds a single integer, rather than a nested list.
 *     bool isInteger() const;
 *
 *     // Return the single integer that this NestedInteger holds, if it holds a single integer
 *     // The result is undefined if this NestedInteger holds a nested list
 *     int getInteger() const;
 *
 *     // Set this NestedInteger to hold a single integer.
 *     void setInteger(int value);
 *
 *     // Set this NestedInteger to hold a nested list and adds a nested integer to it.
 *     void add(const NestedInteger &ni);
 *
 *     // Return the nested list that this NestedInteger holds, if it holds a nested list
 *     // The result is undefined if this NestedInteger holds a single integer
 *     const vector<NestedInteger> &getList() const;
 * };
 */
class Solution {
public:
    NestedInteger deserialize(string s) {
        int u = 0;
        return dfs(s, u);
    }

    NestedInteger dfs(string& s, int &u)
    {
        NestedInteger res;
        if (s[u] == '[') {
            u ++ ;
            while (s[u] != ']') res.add(dfs(s, u));
            if (s[u] == ']') u ++ ;
            if (u < s.size() && s[u] == ',') u ++ ;
        } else {
            int k = u;
            while (k < s.size() && s[k] != ',' && s[k] != ']') k ++ ;
            res.setInteger(stoi(s.substr(u, k - u)));
            if (k < s.size() && s[k] == ',') k ++ ;
            u = k;
        }
        return res;
    }
};