(Leetcode) 扁平化嵌套列表迭代器 - Python实现

题目：扁平化嵌套列表迭代器
给定一个嵌套的整型列表。设计一个迭代器，使其能够遍历这个整型列表中的所有整数。
列表中的项或者为一个整数，或者是另一个列表。
示例:
输入: [[1,1],2,[1,1]]，输出: [1,1,2,1,1]
解释: 通过重复调用 next 直到 hasNext 返回false，next 返回的元素的顺序应该是: [1,1,2,1,1]。
输入: [1,[4,[6]]]，输出: [1,4,6]
解释: 通过重复调用 next 直到 hasNext 返回false，next 返回的元素的顺序应该是: [1,4,6]。

# """
# 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]
#        """

--------------------------------------------------------------------------------------

解法1#：通过队列，将嵌套列表nestedList内的所有整数都入队，取下一个时出队。入队时，若为整数，则直接入队，若为嵌套列表，则递归调用入队函数。

注：想了解双向队列的童鞋，可以参考我之前的博客 https://blog.csdn.net/weixin_42077402/article/details/92640394

import collections

class NestedIterator(object):

    def __init__(self, nestedList):
        """
        Initialize your data structure here.
        :type nestedList: List[NestedInteger]
        """
        # 创建双向队列
        self.queue = collections.deque()

        def getAll(nestedList):
            for nest in nestedList:
                # 如果元素为整数integer
                if nest.isInteger():
                    self.queue.append(nest.getInteger())
                else:
                    # 如果元素是list，就递归调用getAll()
                    getAll(nest.getList())

        # 将所有数字元素按顺序存入双向队列
        getAll(nestedList)

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

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

 

参考：

https://suixinblog.cn/2019/06/leetcode-flatten-nested-list-iterator.html

https://blog.csdn.net/weixin_43730955/article/details/88060758

https://blog.csdn.net/weixin_42077402/article/details/92640394