-
Notifications
You must be signed in to change notification settings - Fork 116
/
Copy pathpeeking_iterator.cpp
50 lines (44 loc) · 1.09 KB
/
peeking_iterator.cpp
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
// Below is the interface for Iterator, which is already defined for you.
// **DO NOT** modify the interface for Iterator.
class Iterator {
struct Data;
Data* data;
public:
Iterator(const vector<int>& nums);
Iterator(const Iterator& iter);
virtual ~Iterator();
// Returns the next element in the iteration.
int next();
// Returns true if the iteration has more elements.
bool hasNext() const;
};
class PeekingIterator : public Iterator {
int cache;
bool is_peeked;
public:
PeekingIterator(const vector<int>& nums) : Iterator(nums), is_peeked(false) {
}
// Returns the next element in the iteration without advancing the iterator.
int peek() {
if (!is_peeked) {
cache = Iterator::next();
is_peeked = true;
}
return cache;
}
// hasNext() and next() should behave the same as in the Iterator interface.
// Override them if needed.
int next() {
if (is_peeked) {
is_peeked = false;
return cache;
}
return Iterator::next();
}
bool hasNext() const {
if (is_peeked) {
return true;
}
return Iterator::hasNext();
}
};