LC 341. 扁平化嵌套列表迭代器

题目描述

给你一个嵌套的整型列表。请你设计一个迭代器，使其能够遍历这个整型列表中的所有整数。

列表中的每一项或者为一个整数，或者是另一个列表。其中列表的元素也可能是整数或是其他列表。

样例

输入: [[1,1],2,[1,1]]
输出: [1,1,2,1,1]
解释: 通过重复调用 next 直到 hasNext 返回 false，next 返回的元素的顺序应该是: [1,1,2,1,1]。

---

使用dfs先将原List中的元素依次存储到一个数组中，完后对数组中的元素一次操作即可

注意数组尺寸1e5+，题目中貌似没有提示，开的太小会出错

C++ 代码

/**
 * // This is the interface that allows for creating nested lists.
 * // You should not implement it, or speculate about its implementation
 * class NestedInteger {
 *   public:
 *     // 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;
 *
 *     // 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;
 * };
 */
const int N = 100005;
class NestedIterator {
public:

    int a[N];
    int idx = 0;
    int it = 0;
    
    void dfs(vector<NestedInteger> &list) {
        for (int i = 0; i < list.size(); i ++ ) {
            if (list[i].isInteger()) a[idx ++ ] = list[i].getInteger();
            else dfs(list[i].getList());
        }
    }

    NestedIterator(vector<NestedInteger> &nestedList) {
        dfs(nestedList);
    }
    
    int next() {
        return a[it ++ ];
    }
    
    bool hasNext() {
        return it < idx;
    }
};

/**
 * Your NestedIterator object will be instantiated and called as such:
 * NestedIterator i(nestedList);
 * while (i.hasNext()) cout << i.next();
 */