341. 扁平化嵌套列表迭代器
题目描述
解题思路
- 方法一:
遍历所有元素,存在列表中。这种方法不是最优解。
代码实现
# """
# 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]):
self.arr = []
def dfs(nests):
for ele in nests:
if ele.isInteger():
self.arr.append(ele.getInteger())
else:
dfs(ele.getList())
dfs(nestedList)
def next(self) -> int:
return self.arr.pop(0)
def hasNext(self) -> bool:
return len(self.arr)
# Your NestedIterator object will be instantiated and called as such:
# i, v = NestedIterator(nestedList), []
# while i.hasNext(): v.append(i.next())