Given an Iterator class interface with methods: next()
and hasNext()
, design and implement a PeekingIterator that support the peek()
operation -- it essentially peek() at the element that will be returned by the next call to next().
Example:
Assume that the iterator is initialized to the beginning of the list:[1,2,3]
. Callnext()
gets you 1, the first element in the list. Now you callpeek()
and it returns 2, the next element. Callingnext()
after that still return 2. You callnext()
the final time and it returns 3, the last element. CallinghasNext()
after that should return false.
// 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
{
private:
int index;
int now;
vector<int> nums;
public:
PeekingIterator(const vector<int>& nums) : Iterator(nums) {
// Initialize any member here.
// **DO NOT** save a copy of nums and manipulate it directly.
// You should only use the Iterator interface methods.
this->nums=nums;
index=0;
now=-1;
}
// Returns the next element in the iteration without advancing the iterator.
int peek() {
return nums[now+1];
}
// hasNext() and next() should behave the same as in the Iterator interface.
// Override them if needed.
int next() {
if(hasNext())
{
now=index;
return nums[index++];
}
return nums[now];
}
bool hasNext() const {
return index<nums.size();
}
};
Success
Details
Runtime: 8 ms, faster than 61.36% of C++ online submissions for Peeking Iterator.
Memory Usage: 10.1 MB, less than 36.34% of C++ online submissions for Peeking Iterator.