-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathflattenNestedListIterator.py
More file actions
50 lines (44 loc) · 1.57 KB
/
flattenNestedListIterator.py
File metadata and controls
50 lines (44 loc) · 1.57 KB
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
#! /usr/bin/env python3
# -*- coding: utf-8 -*-
# Source: https://leetcode.com/problems/flatten-nested-list-iterator/
# Author: Miao Zhang
# Date: 2021-02-03
# """
# 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
# """
from collections import deque
class NestedIterator:
def __init__(self, nestedList: [NestedInteger]):
self.q = deque()
def makequeue(nestedList: [NestedInteger]):
for n in nestedList:
if n.isInteger():
self.q.append(n.getInteger())
else:
makequeue(n.getList())
makequeue(nestedList)
def next(self) -> int:
return self.q.popleft()
def hasNext(self) -> bool:
return len(self.q) > 0
# Your NestedIterator object will be instantiated and called as such:
# i, v = NestedIterator(nestedList), []
# while i.hasNext(): v.append(i.next())