Leetcode: Peeking Iterator
来源:互联网 发布:高斯朴素贝叶斯 数据 编辑:程序博客网 时间:2024/04/28 18:46
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().
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. CallinghasNext()
after that should return false.
Peek可以先被调用,可以一直重复调用,返回当前第一个元素。
// 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: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. m_alreadyNext = false;} // Returns the next element in the iteration without advancing the iterator.int peek() { if (!m_alreadyNext) { m_peekNum = Iterator::next(); m_alreadyNext = true; } return m_peekNum;}// hasNext() and next() should behave the same as in the Iterator interface.// Override them if needed.int next() { if (m_alreadyNext) { m_alreadyNext = false; return m_peekNum; } else { return Iterator::next(); }}bool hasNext() const { return (m_alreadyNext || Iterator::hasNext());}private: int m_peekNum; bool m_alreadyNext;};
0 0
- leetcode 284 Peeking Iterator
- [LeetCode 284] Peeking Iterator
- leetcode 284: Peeking Iterator
- Leetcode Peeking Iterator
- *LeetCode-Peeking Iterator
- [Leetcode] Peeking Iterator
- [Leetcode]Peeking Iterator
- leetcode Peeking Iterator
- Peeking Iterator -- leetcode
- leetcode之Peeking Iterator
- [LeetCode] Peeking Iterator
- LeetCode Peeking Iterator 迭代器
- 【leetcode】Peeking Iterator
- Leetcode: Peeking Iterator
- LeetCode 284 Peeking Iterator
- LeetCode Peeking Iterator
- leetcode Peeking Iterator
- [leetcode]Peeking Iterator
- (解题报告)HDU2005---第几天
- Android Studio放置jar跟os库的位置
- 字体图标兼容性,兼容IE
- 01.使用Charles抓包获取API
- 【蓝桥第二周】矩阵最大和
- Leetcode: Peeking Iterator
- 【日记-C语言】ACM读错题了q.q(题-码)
- (解题报告)HDU2006---求奇数的乘积
- 线段树
- Java——用户界面的布局
- BAYKEE app开发中遇到的一些问题和解决办法
- 用 Redis 实现分布式锁
- poj2479 Maximum sum
- BestCoder Round #65 HDU 5593 ZYB's Tree (树形DP)