-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathPeeking Iterator.py
More file actions
63 lines (54 loc) · 1.48 KB
/
Copy pathPeeking Iterator.py
File metadata and controls
63 lines (54 loc) · 1.48 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
51
52
53
54
55
56
57
58
59
60
61
62
63
__author__ = 'Martin'
class Iterator(object):
def __init__(self, nums):
"""
Initializes an iterator object to the beginning of a list.
:type nums: List[int]
"""
def hasNext(self):
"""
Returns true if the iteration has more elements.
:rtype: bool
"""
def next(self):
"""
Returns the next element in the iteration.
:rtype: int
"""
class PeekingIterator(object):
def __init__(self, iterator):
"""
Initialize your data structure here.
:type iterator: Iterator
"""
self.peeked = False
self.peekele = -1
self.it = iterator
def peek(self):
"""
Returns the next element in the iteration without advancing the iterator.
:rtype: int
"""
if self.peeked is False:
self.peeked = True
self.peekele = self.it.next()
return self.peekele
def next(self):
"""
:rtype: int
"""
if self.peeked is True:
self.peeked = False
return self.peekele
else:
return self.it.next()
def hasNext(self):
"""
:rtype: bool
"""
return self.peeked or self.it.hasNext()
nums = [1,2,3,4]
iter = PeekingIterator(Iterator(nums))
while iter.hasNext():
val = iter.peek() # Get the next element but not advance the iterator.
iter.next() # Should return the same value as [val].