LeetCode:Peeking Iterator

最新推荐文章于 2020-03-02 10:58:25 发布

walker lee

最新推荐文章于 2020-03-02 10:58:25 发布

阅读量459

点赞数

分类专栏： LeetCode OJ LeetCode解题记录文章标签： LeetCode Peeking Iterator

本文链接：https://blog.csdn.net/itismelzp/article/details/51557790

版权

LeetCode OJ 同时被 2 个专栏收录

216 篇文章 0 订阅

订阅专栏

LeetCode解题记录

216 篇文章 13 订阅

订阅专栏

本文介绍如何设计并实现PeekingIterator类，该类在继承Iterator接口的基础上新增了peek()方法，能够预览序列中下一个元素而不改变迭代状态。文章通过示例详细解释了PeekingIterator的工作原理。

摘要由CSDN通过智能技术生成

Peeking Iterator

Total Accepted: 20942 Total Submissions: 62056 Difficulty: Medium

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. Calling hasNext() after that should return false.

Hint:

Think of "looking ahead". You want to cache the next element.
Is one variable sufficient? Why or why not?
Test your design with call order of peek() before next() vs next() before peek().
For a clean implementation, check out Google's guava library source code.

Follow up: How would you extend your design to be generic and work with all types, not just integer?

Credits:
Special thanks to @porker2008 for adding this problem and creating all test cases.

Subscribe to see which companies asked this question

Hide Tags

Design

Hide Similar Problems

(M) Binary Search Tree Iterator (M) Flatten 2D Vector (M) Zigzag Iterator

思路：

将“下一个”数缓存起来。

java code:

// Java Iterator interface reference:
// https://docs.oracle.com/javase/8/docs/api/java/util/Iterator.html
class PeekingIterator implements Iterator<Integer> {

    private Integer next;
    private Iterator<Integer> iterator;

	public PeekingIterator(Iterator<Integer> iterator) {
	    // initialize any member here.
	    this.iterator = iterator;
	    
	    if(iterator.hasNext()) next = iterator.next();
	}

    // Returns the next element in the iteration without advancing the iterator.
	public Integer peek() {
        return next;
	}

	// hasNext() and next() should behave the same as in the Iterator interface.
	// Override them if needed.
	@Override
	public Integer next() {
	    Integer tmp = next;
	    next = iterator.hasNext() ? iterator.next() : null;
	    return tmp;
	}

	@Override
	public boolean hasNext() {
	    return next != null;
	}
}