###问题描述
实现一个跳过null值的迭代器
[null,"1","2","3",null,"4",null]->["1","2","3","4"]
[null]->[]
[]->[]
###原来ide
Iterator<String> iterator = new Iterator<String>() { private Iterator<String> sourceIterator = source.iterator(); private String next; public boolean hasNext() { while (sourceIterator.hasNext()) { next = sourceIterator.next(); if (next != null) { return true; } } next = null; return false; } public String next() { while (next == null) { next = sourceIterator.next(); } String temp = next; next = null; return temp; } public void remove() { } };
我须要写的如此复杂,才能保持Iterator特性,针对第一个case连续调用5次next方法抛出异常
###使用Guavacode
Iterator<String> iterator = new AbstractIterator<String>() { private Iterator<String> sourceIterator = source.iterator(); @Override protected String computeNext() { while (sourceIterator.hasNext()) { String next = sourceIterator.next(); if (next != null) { return next; } } return endOfData(); } };
只须要关注如何获取下一个值就能够了,不须要关注如何实现hasNext方法。
须要注意:AbstractIterator不支持remove方法rem