-
Notifications
You must be signed in to change notification settings - Fork 17
/
Copy pathflatten-nested-list-iterator.py
94 lines (78 loc) · 2.58 KB
/
flatten-nested-list-iterator.py
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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
# """
# This is the interface that allows for creating nested lists.
# You should not implement it, or speculate about its implementation
# """
#class NestedInteger(object):
# def isInteger(self):
# """
# @return True if this NestedInteger holds a single integer, rather than a nested list.
# :rtype bool
# """
#
# def getInteger(self):
# """
# @return the single integer that this NestedInteger holds, if it holds a single integer
# Return None if this NestedInteger holds a nested list
# :rtype int
# """
#
# def getList(self):
# """
# @return the nested list that this NestedInteger holds, if it holds a nested list
# Return None if this NestedInteger holds a single integer
# :rtype List[NestedInteger]
# """
class NestedIterator(object):
def __init__(self, nestedList):
"""
Initialize your data structure here.
:type nestedList: List[NestedInteger]
"""
self.container = nestedList
self.stack = [-1]
self.has_next_res = False
self.has_next_counter = 0
def _elem_exists_in_stack(self):
cont = self.container
for index in self.stack:
cont_list = cont if isinstance(cont, list) else cont.getList()
if index >= len(cont_list):
return False
else:
cont = cont_list[index]
return True
def _get_elem_from_stack(self):
cont = self.container
for index in self.stack:
cont_list = cont if isinstance(cont, list) else cont.getList()
cont = cont_list[index]
return cont
def next(self):
"""
:rtype: int
"""
self.has_next_counter = 0
return self._get_elem_from_stack().getInteger()
def hasNext(self):
"""
:rtype: bool
"""
if self.has_next_counter > 0:
return self.has_next_res
self.has_next_counter += 1
while self.stack:
self.stack[-1] += 1
if self._elem_exists_in_stack():
elem = self._get_elem_from_stack()
if elem.isInteger():
self.has_next_res = True
return self.has_next_res
else:
self.stack.append(-1)
else:
self.stack.pop()
self.has_next_res = False
return self.has_next_res
# Your NestedIterator object will be instantiated and called as such:
# i, v = NestedIterator(nestedList), []
# while i.hasNext(): v.append(i.next())