341. Flatten Nested List Iterator - python3

Given a nested list of integers, implement an iterator to flatten it.

Each element is either an integer, or a list -- whose elements may also be integers or other lists.

뭔소린지 아시는 분 연락주세요

Solution 1: Runtime: 68 ms - 59.60% / Memory Usage: 17.7 MB - 30.38%

# """
# 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.queue = []
        self.flattenList(nestedList)
        
    def next(self) -> int:
        return self.queue.pop(0)
    
    def hasNext(self) -> bool:
         return len(self.queue) > 0
        
    def flattenList(self, nestedList):
        for item in nestedList:
            if(not item.isInteger()):
                self.flattenList(item.getList())
            else:
                self.queue.append(item.getInteger())
                

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

왜 저렇게 함수가 많은지 기절하실 지경이지만..

queue 를 이용한 방식

flattenList 함수에서 nestedList 의 item 값이 정수만으로 구성된 게 아니면 계속 재귀를 돌림
정수만 있을 경우는 queue 에 넣어준다