# 385. Mini Parser

Given a nested list of integers represented as a string, implement a parser to deserialize it.

Each element is either an integer, or a list -- whose elements may also be integers or other lists.

**Note:** You may assume that the string is well-formed:

* String is non-empty.
* String does not contain white spaces.
* String contains only digits `0-9`, `[`, `-` `,`, `]`.

**Example 1:**

```
Given s = "324",

You should return a NestedInteger object which contains a single integer 324.
```

**Example 2:**

```
Given s = "[123,[456,[789]]]",

Return a NestedInteger object containing a nested list with 2 elements:

1. An integer containing value 123.
2. A nested list containing two elements:
    i.  An integer containing value 456.
    ii. A nested list with one element:
         a. An integer containing value 789.
```

```cpp
/**
 * // 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;
 * };
 */
```

```cpp
// Iterative DFS
NestedInteger deserialize(string s) { // time: O(n); space: O(n)
    if (s.empty()) return NestedInteger();
    if (s[0] != '[') return NestedInteger(stoi(s));
    stack<NestedInteger> st;
    int start = 1;
    for (int i = 0; i < s.length(); ++i) {
        if (s[i] == '[') {
            st.push(NestedInteger());
            start = i + 1;
        } else if (s[i] == ',' || s[i] == ']') {
            if (i > start) {
                st.top().add(NestedInteger(stoi(s.substr(start, i - start))));
            }
            start = i + 1;
            if (s[i] == ']') {
                if (st.size() > 1) { // handle case such as "[]"
                    NestedInteger t = st.top(); st.pop();
                    st.top().add(t);
                }
            }
        }
    }
    return st.top();
}
```

```cpp
// Recursive DFS
NestedInteger deserialize(string s) {
    if (s.empty()) return NestedInteger();
    if (s[0] != '[') return NestedInteger(stoi(s));
    if (s.size() <= 2) return NestedInteger();
    NestedInteger res;
    int start = 1, cnt = 0;
    for (int i = 1; i < s.length(); ++i) {
        if (cnt == 0 && (i == s.length() - 1 || s[i] == ',')) {
            res.add(deserialize(s.substr(start, i - start)));
            start = i + 1;
        } else if (s[i] == '[') ++cnt;
        else if (s[i] == ']') --cnt;
    }
    return res;
}
```

```cpp
// stringstream
NestedInteger deserialize(istringstream& in) {
    int num;
    if (in >> num) return NestedInteger(num);
    in.clear(); // clear error flag
    in.get(); // get next
    NestedInteger list;
    while (in.peek() != ']') {
        list.add(deserialize(in));
        if (in.peek() == ',')
            in.get();
    }
    in.get();
    return list;
}
NestedInteger deserialize(string s) {
    istringstream in(s);
    return deserialize(in);
}
```


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://jimmylin1991.gitbook.io/practice-of-algorithm-problems/dfs-and-bfs/385.-mini-parser.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.