leetcode_Peeking Iterator

描述：

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:

1. Think of "looking ahead". You want to cache the next element.Show More Hint 

思路：

刚开始看的话感觉这题有点莫名其妙，iterator只有hasNext(),next()的功能，没有peek()的功能啊，确实，题目要求就是让你在原来的基础上增加peek()功能的，还别说，真想不出来，好吧，看下Hint，原来如此，增加个保存弹出元素的队列不就可以了么，访问元素时优先访问队列，用队列的peek（）和poll（）来实现iterator的peek（）和next（）功能，这当然是可以的，实现起来也很简单。但一定要用一个队列来缓存删除的元素么？其实还有更简单的方法。

代码：

用队列来辅助iterator实现peek（）和next的功能

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

	Iterator<Integer>iterator=null;
	Queue<Integer>queue=null;
	public PeekingIterator(Iterator<Integer> iterator) {
	    // initialize any member here.
	    this.iterator=iterator;
	    queue=new LinkedList<Integer>();
	}

    // Returns the next element in the iteration without advancing the iterator.
	public Integer peek() {
		int num=0;
		if(!queue.isEmpty())
		{
			 num=queue.peek();
		}else {
			num=iterator.next();
			queue.add(num);
		}
		return num;
        
	}

	// hasNext() and next() should behave the same as in the Iterator interface.
	// Override them if needed.
	@Override
	public Integer next() {
		int num=0;
		if(!queue.isEmpty())
		{
			 num=queue.poll();
		}else {
			num=iterator.next();
		}
		return num;
	    
	}

	@Override
	public boolean hasNext() {
		return !queue.isEmpty()||iterator.hasNext();
	    
	}
}

但用队列 话空间复杂度就O(n)了啊，有更粗暴的方法么？当然是有的，用一个变量来缓存元素的值，漂亮！

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

	Iterator<Integer>iterator=null;
	Integer next=null;
	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 cur=next;
		next=iterator.hasNext()?iterator.next():null;
		return cur;
	    
	}

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