FilesExpand file tree

 master

/

zigzag-iterator.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

31 lines (26 loc) · 726 Bytes

 master

/

zigzag-iterator.py

Copy path

Top

File metadata and controls

• Code
• Blame

31 lines (26 loc) · 726 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

# Time: O(n)

# Space: O(k)

class ZigzagIterator(object):

def __init__(self, v1, v2):

"""

Initialize your q structure here.

:type v1: List[int]

:type v2: List[int]

"""

self.q = collections.deque([(len(v), iter(v)) for v in (v1, v2) if v])

def next(self):

"""

:rtype: int

"""

len, iter = self.q.popleft()

if len > 1:

self.q.append((len-1, iter))

return next(iter)

def hasNext(self):

"""

:rtype: bool

"""

return bool(self.q)

# Your ZigzagIterator object will be instantiated and called as such:

# i, v = ZigzagIterator(v1, v2), []

# while i.hasNext(): v.append(i.next())