Description
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].
Example 2:
Input: [1,[4,[6]]]
Output: [1,4,6]
Explanation: By calling next repeatedly until hasNext returns false,
the order of elements returned by next should be: [1,4,6].
分析
题目的意思是:把嵌套的多维数组拉伸为一维数组。
- 看到这种嵌套,最先想到的应该是递归,然后用队列辅助实现next,hasnext 函数。
代码
/**
* // 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:
queue<int> q;
void make_queue(vector<NestedInteger> &nestedList){
for(auto a:nestedList){
if(a.isInteger()) q.push(a.getInteger());
else{
make_queue(a.getList());
}
}
}
public:
NestedIterator(vector<NestedInteger> &nestedList) {
make_queue(nestedList);
}
int next() {
int t=q.front();
q.pop();
return t;
}
bool hasNext() {
return !q.empty();
}
};
/**
* Your NestedIterator object will be instantiated and called as such:
* NestedIterator i(nestedList);
* while (i.hasNext()) cout << i.next();
*/