-
Notifications
You must be signed in to change notification settings - Fork 0
/
flatten-nested-list-iterator.cpp
48 lines (43 loc) · 1.4 KB
/
flatten-nested-list-iterator.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
/**
* // 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:
NestedIterator(vector<NestedInteger> &nestedList) {
dfs(nestedList);
}
void dfs(const vector<NestedInteger> &nestedList){
for(const auto &n:nestedList){
if(n.isInteger()) vec.push_back(n.getInteger());
else dfs(n.getList());
}
}
int next() {
return vec[index++];
}
bool hasNext() {
if(vec.size()==0) return false;
return index<=vec.size()-1;
}
vector<int> vec;
int index=0;
};
/**
* Your NestedIterator object will be instantiated and called as such:
* NestedIterator i(nestedList);
* while (i.hasNext()) cout << i.next();
*/