-
Notifications
You must be signed in to change notification settings - Fork 19
/
answer.py
66 lines (57 loc) · 1.89 KB
/
answer.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
#!/usr/bin/env python3
#-------------------------------------------------------------------------------
# """
# 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.flatlist = []
self.idx = 0
self.addLists(nestedList)
def next(self):
"""
:rtype: int
"""
if self.hasNext:
self.idx += 1
return self.flatlist[self.idx-1]
def hasNext(self):
"""
:rtype: bool
"""
return self.idx < len(self.flatlist)
def addLists(self, nest):
for element in nest:
if not element.isInteger():
self.addLists(element.getList())
else:
self.flatlist.append(element.getInteger())
# Your NestedIterator object will be instantiated and called as such:
# i, v = NestedIterator(nestedList), []
# while i.hasNext(): v.append(i.next())
#-------------------------------------------------------------------------------