-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path284.PeekingIterator.cpp
More file actions
51 lines (46 loc) · 1.33 KB
/
284.PeekingIterator.cpp
File metadata and controls
51 lines (46 loc) · 1.33 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
// 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 {
public:
int current;
bool current_valid;
PeekingIterator(const vector<int>& nums) : Iterator(nums),
current_valid(false) {
// Initialize any member here.
// **DO NOT** save a copy of nums and manipulate it directly.
// You should only use the Iterator interface methods.
if(Iterator::hasNext()){
current = Iterator::next();
current_valid = true;
}
}
// Returns the next element in the iteration without advancing the iterator.
int peek() {
return current;
}
// hasNext() and next() should behave the same as in the Iterator interface.
// Override them if needed.
int next() {
int ret = current;
if(Iterator::hasNext())
current = Iterator::next();
else
current_valid = false;
return ret;
}
bool hasNext() const {
return current_valid;
}
};