这个class implement iterator 所以不用管是用在什么数据结构上面 可以直接使用 iterator的next hasnext
因为要peek 所以用一个int记录已经peek的值 因为peek必定挪动指针 可是再next却不能再挪了 所以就通过判断这个int是否为null来判断next之前是否peek过了
注意peek时也要判断int是否是null 连续peek两次应该只挪动一次
hasnext也是一样 假如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> it = null;
Integer n = null;
public PeekingIterator(Iterator<Integer> iterator) {
this.it = iterator;
}
// Returns the next element in the iteration without advancing the iterator.
public Integer peek() {
if ( this.n == null && this.it.hasNext())
this.n = this.it.next();
return this.n;
}
// hasNext() and next() should behave the same as in the Iterator interface.
// Override them if needed.
@Override
public Integer next() {
if ( this.n != null ){
Integer res = this.n;
this.n = null;
return res;
}
else{
return this.it.next();
}
}
@Override
public boolean hasNext() {
if ( this.n != null )
return true;
return this.it.hasNext();
}
}