Mini Parser

1. 解析

题目大意，解析给定字符串，返回嵌套数组(数组当中的每个元素为一个单独的数字或者一个数组)

2. 分析

嵌套表(广义表)的结构体相关的操作已经给出，我们只需调用所给定的方法对字符串进行解析，字符串包含3种不同的字符:[ '数字', '[', ']' ]，'['是下一层开始的标记，']'是下一层结束的标记。为了能回溯到上一层，利用栈进行存储。对字符串进行遍历，当检测到'['，意味着新一层开始的标记，新建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) {        
        if (s.empty()) return NestedInteger();
        if (s[0] != '[') return NestedInteger(atoi(s.c_str()));
        stack<NestedInteger> v;
        int start;
        for (int i = 0; i < s.length(); ++i){
            if (s[i] == '['){
                v.push(NestedInteger()); //列表
                start = i + 1; //记录元素的起始位置
            }
            else if (s[i] == ',' || s[i] == ']'){ //列表中的元素是数字或者列表
                if (i > start) v.top().add(NestedInteger(atoi(s.substr(start, i - start).c_str())));
                start = i + 1;
                if (s[i] == ']'){ //列表当中的元素是一个列表
                    if (v.size() > 1){
                        NestedInteger cur = v.top();
                        v.pop();
                        v.top().add(cur);
                    }
                }
            }
        }
        return v.top();
    }
};

[1]https://www.cnblogs.com/grandyang/p/5771434.html