力扣341. 扁平化嵌套列表迭代器(深度优先搜索)
https://leetcode-cn.com/problems/flatten-nested-list-iterator/
深度优先搜索
思路
在构造函数中直接解析所有元素(用数组保存),然后在遍历时依次输出即可
其实要解析一个扁平化嵌套列表,思路与dfs
非常类似,将vector<NestedInteger>
当作一个非连通图,每个NestedInteger
是一个连通图,里面存了各个节点及其所有的邻接点。
然后在遍历每个图时,只要遇到整型Integer
,直接输出,如果是列表vector<NestedInteger>
,递归访问该列表中的所有节点。
代码就很简单,递归访问每个扁平化嵌套列表即可。
复杂度分析
-
时间复杂度:初始化为 O(n),next 和 hasNext 为 O(1)。其中 n 是嵌套的整型列表中的元素个数。
-
空间复杂度:O(n)。需要一个数组存储嵌套的整型列表中的所有元素。
/**
* // 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;
* };
*/
class NestedIterator {
public:
vector<int> myval;
vector<int>::iterator cur;
NestedIterator(vector<NestedInteger> &nestedList) {
dfs(nestedList);
cur=myval.begin();
}
void dfs(const vector<NestedInteger> &nestedList)
{
for(auto &nest :nestedList)
{
if(nest.isInteger())
{
myval.push_back(nest.getInteger());
}
else
{
dfs(nest.getList());
}
}
}
int next() {
return *cur++;
}
bool hasNext() {
return cur!=myval.end();
}
};
/**
* Your NestedIterator object will be instantiated and called as such:
* NestedIterator i(nestedList);
* while (i.hasNext()) cout << i.next();
*/