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.
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;
};
/* 设计peek (类似于top())只查看值而不移动指针
* 当没有调用next时 始终保存一个当前栈顶的值 调用后进行更新
* */
class PeekingIterator : public Iterator {
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.
}
// Returns the next element in the iteration without advancing the iterator.
int peek() {
return Iterator(*this).next();// 调用拷贝构造函数创建副本 调用next 是对副本的调用 而且会自动析构
}
// hasNext() and next() should behave the same as in the Iterator interface.
// Override them if needed.
int next() {
return Iterator::next();
}
bool hasNext() const {
return Iterator::hasNext();
}
};