341. 扁平化嵌套列表迭代器
给你一个嵌套的整型列表。请你设计一个迭代器,使其能够遍历这个整型列表中的所有整数。
列表中的每一项或者为一个整数,或者是另一个列表。其中列表的元素也可能是整数或是其他列表。
示例 1:
输入: [[1,1],2,[1,1]]
输出: [1,1,2,1,1]
解释: 通过重复调用 next 直到 hasNext 返回 false,next 返回的元素的顺序应该是: [1,1,2,1,1]。
示例 2:
输入: [1,[4,[6]]]
输出: [1,4,6]
解释: 通过重复调用 next 直到 hasNext 返回 false,next 返回的元素的顺序应该是: [1,4,6]。
设计迭代器遍历嵌套列表
(1)先把每一个节点放入S;
(2)调用hasnext时,把下一个的层数解开;
(3)调用next,得到下一层;
/**
* // 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:
stack<NestedInteger> S;
public:
NestedIterator(vector<NestedInteger> &nestedList) {
for(auto iter=nestedList.rbegin();iter!=nestedList.rend();iter++)
S.push(*iter);
}
int next() {
auto res=S.top();
S.pop();
return res.getInteger();
}
bool hasNext() {
while(!S.empty()) {
auto iter = S.top();
if(iter.isInteger()) return true;
S.pop();
auto list=iter.getList();
for(auto i = list.rbegin();i!=list.rend();i++)
S.push(*i);
}
return false;
}
};
/**
* Your NestedIterator object will be instantiated and called as such:
* NestedIterator i(nestedList);
* while (i.hasNext()) cout << i.next();
*/