一、题目
给你一个嵌套的整型列表。请你设计一个迭代器,使其能够遍历这个整型列表中的所有整数。
列表中的每一项或者为一个整数,或者是另一个列表。其中列表的元素也可能是整数或是其他列表。
示例:
输入: [1,[4,[6]]]
输出: [1,4,6]
解释: 通过重复调用 next 直到 hasNext 返回 false,next 返回的元素的顺序应该是: [1,4,6]。
二、代码
思路:
- 主要思路就是递归,其实递归就属于一种dfs,将嵌套的列表的数据存于自己定义的vector中
- 题目给的做法是用迭代器,迭代器比index要快一些
/**
* // 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 {
private:
vector<int> list;
vector<int>::iterator ite;
void parseNestedInteger(NestedInteger n){
if(n.isInteger()) list.push_back(n.getInteger());
else{
for(auto item:n.getList()) parseNestedInteger(item);
}
}
public:
NestedIterator(vector<NestedInteger> &nestedList) {
for(auto item:nestedList){
parseNestedInteger(item);
}
ite=list.begin();
}
int next() {
return *(ite++);
}
bool hasNext() {
return ite!=list.end();
}
};
/**
* Your NestedIterator object will be instantiated and called as such:
* NestedIterator i(nestedList);
* while (i.hasNext()) cout << i.next();
*/