leetcode 284. Peeking Iterator
2016-04-05 17:05
169 查看
Given an Iterator class interface with methods:
design and implement a PeekingIterator that support the
peek() at the element that will be returned by the next call to next().
Here is an example. Assume that the iterator is initialized to the beginning of the list:
Call
Now you call
that still return 2.
You call
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 {
vector<int>num;
int k = 0;
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.
num = nums;
}
// Returns the next element in the iteration without advancing the iterator.
int peek() {
return num[k];
}
// hasNext() and next() should behave the same as in the Iterator interface.
// Override them if needed.
int next() {
return num[k++];
}
bool hasNext() const {
return k < num.size();
}
};
accept
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().
Here is an example. Assume that the iterator is initialized to the beginning of the list:
[1, 2, 3].
Call
next()gets you 1, the first element in the list.
Now you call
peek()and it returns 2, the next element. Calling
next()after
that still return 2.
You call
next()the final time and it returns 3, the last element. Calling
hasNext()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 {
vector<int>num;
int k = 0;
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.
num = nums;
}
// Returns the next element in the iteration without advancing the iterator.
int peek() {
return num[k];
}
// hasNext() and next() should behave the same as in the Iterator interface.
// Override them if needed.
int next() {
return num[k++];
}
bool hasNext() const {
return k < num.size();
}
};
accept
相关文章推荐
- CodeForces 368B:Sereja and Suffixes【水】
- 《Linux内核设计与实现》第三章读书笔记
- 动态代理的应用
- haproxy简述
- JAVA基础----java中E,T,?的区别?【转】
- Linux服务器如何查看CPU占用率、内存占用、带宽占用
- python字典和集合,frozenset和哈希值
- 安装pcre-8.30报错
- CCF Z字形扫描
- Linux软连接和硬链接
- 程序员面试宝典16章操作系统整理笔记及补充(个人理解整理版)
- Eclipse使用maven构建web项目
- iOS地理位置解析
- Android小程序-Walker注册页面(二)
- if __name__ == '__main__'在python中的应用
- 添加约束
- Web应用中路径问题
- VC控件——ListControl
- hdu 2828 Lamp 贪心 + 二分匹配
- UISearchBar(搜索框)的方法属性介绍