-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathFlattenNestedListIterator.py
More file actions
51 lines (45 loc) · 1.66 KB
/
FlattenNestedListIterator.py
File metadata and controls
51 lines (45 loc) · 1.66 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
# """
# This is the interface that allows for creating nested lists.
# You should not implement it, or speculate about its implementation
# """
#class NestedInteger:
# def isInteger(self) -> bool:
# """
# @return True if this NestedInteger holds a single integer, rather than a nested list.
# """
#
# def getInteger(self) -> int:
# """
# @return the single integer that this NestedInteger holds, if it holds a single integer
# Return None if this NestedInteger holds a nested list
# """
#
# def getList(self) -> [NestedInteger]:
# """
# @return the nested list that this NestedInteger holds, if it holds a nested list
# Return None if this NestedInteger holds a single integer
# """
class NestedIterator:
def __init__(self, nestedList: [NestedInteger]):
# def flatten_list(n):
# for nested_int in nested_list:
# if nested_int.isInteger():
# yeild (nested_int.getInteger())
# else:
# yeild from flatten_list(nested_int.getList()):
def flatten(n):
res = []
for i in n:
if i.isInteger():
res.append(i.getInteger())
else:
res.extend(flatten(i.getList()))
return res
self.deq = deque(flatten(nestedList))
def next(self) -> int:
return self.deq.popleft()
def hasNext(self) -> bool:
return self.deq
# Your NestedIterator object will be instantiated and called as such:
# i, v = NestedIterator(nestedList), []
# while i.hasNext(): v.append(i.next())