-
Notifications
You must be signed in to change notification settings - Fork 40
Expand file tree
/
Copy pathAnswer80.cpp
More file actions
56 lines (52 loc) · 1.53 KB
/
Answer80.cpp
File metadata and controls
56 lines (52 loc) · 1.53 KB
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
49
50
51
52
53
54
55
56
/**
* // 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;
* };
*/
#define ni NestedInteger
class NestedIterator {
public:
vector<int> v;
int i=0;
void flatten(ni n){
if(n.isInteger()){
v.push_back(n.getInteger());
return;
}
vector<ni> tmp=n.getList();
for(int i=0;i<tmp.size();i++){
flatten(tmp[i]);
}
}
NestedIterator(vector<NestedInteger> &nestedList) {
v.clear();
for(int i=0;i<nestedList.size();i++){
flatten(nestedList[i]);
}
}
int next() {
int ans=v[i];
i++;
return ans;
}
bool hasNext() {
return (i<v.size());
}
};
/**
* Your NestedIterator object will be instantiated and called as such:
* NestedIterator i(nestedList);
* while (i.hasNext()) cout << i.next();
*/