栈和队列_leetcode341

# """
# 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.queue = collections.deque()

def getAll(nests):
for nest in nests:
if nest.isInteger():
 self.queue.append(nest.getInteger())
else:
 getAll(nest.getList())

 getAll(nestedList)



def next(self):
"""
 :rtype: int
 """
 return self.queue.popleft()
def hasNext(self):
"""
 :rtype: bool
 """
 return len(self.queue)

# Your NestedIterator object will be instantiated and called as such:
 # i, v = NestedIterator(nestedList), []
 # while i.hasNext(): v.append(i.next())

转载于:https://www.cnblogs.com/lux-ace/p/10556825.html