leetcode341. Flatten Nested List Iterator（浅）

题目描述

Given a nested list of integers, implement an iterator to flatten it.

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

Example 1:

Input: [[1,1],2,[1,1]]
Output: [1,1,2,1,1]
Explanation: By calling next repeatedly until hasNext returns false,
the order of elements returned by next should be: [1,1,2,1,1].

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/flatten-nested-list-iterator
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

代码

#include <iostream>
#include <vector>

using namespace std;


/// DFS
/// Time Complexity: O(n)
/// Space Complexity: O(h)

// 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 true;} //该项是否为整型

    // 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 -1;} //若判断为整型则获取该整型值

    // 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{return {};}
}; //若非整型则获取该列表，通过vector向量的形式给出，向量中的每一项又是NextedInteger

class NestedIterator {

private:
    vector<int> data;
    int i;

public:
    NestedIterator(vector<NestedInteger> &nestedList) {

        dfs(nestedList);
        i = 0;
    }
    
    // 在hasNext（）为true时，不断调用next（）
    
    int next() { // 返回下一项的整数

        return data[i ++];
    }

    bool hasNext() { //当前迭代器所指向的位置是否是最后一个
        return i < data.size();
    }

private:
    void dfs(const vector<NestedInteger>& nestedList){

        for(const NestedInteger& e: nestedList)
            if(e.isInteger())
                data.push_back(e.getInteger());
            else
                dfs(e.getList());
    }
};


int main() {

    return 0;
}