这一题其实只要找对了方法就是异常简单的一题,我觉得这题其实应该归类为easy。但是既然LEETCODE写了medium我就记录一下吧。
这题做法就是一个,先把iterator next的值保留好,如果call peek,那么就直接返回保留好的值,如果call next,就返回保留好的值的同时,从iterator再取一个next回来。所以实际上iterator当前的状态是已经没有next的,next的值我们已经拿出来放在一个地方了。根据这个理论,很快就可以得到下面这个答案
class PeekingIterator implements Iterator<Integer> {
Integer current = null;
Iterator<Integer> iterator;
public PeekingIterator(Iterator<Integer> iterator) {
// initialize any member here.
this.current = iterator.hasNext() ? iterator.next() : null;
this.iterator = iterator;
}
// Returns the next element in the iteration without advancing the iterator.
public Integer peek() {
return this.current;
}
// hasNext() and next() should behave the same as in the Iterator interface.
// Override them if needed.
@Override
public Integer next() {
Integer result = this.current;
this.current = iterator.hasNext() ? iterator.next() : null;
return result;
}
@Override
public boolean hasNext() {
return this.current != null;
}
}
Follow up的话其实应该指的是java generics,可以看看这个:http://tutorials.jenkov.com/java-generics/implementing-iterable.html或者https://docs.oracle.com/javase/tutorial/java/generics/types.html或者https://docs.oracle.com/javase/tutorial/java/generics/types.html