看了一下马士兵老师讲的设计模式之Iterator,他在视频中为顺序表ArrayList实现了Iterator组件,可以方便的对ArrayList进行遍历。
首先我们理解一下Iterator接口的2个基本方法:
public interface Iterator {
Object next();
boolean hasNext();
}
其中next()返回的是容器中存储的下一个的元素,hasNext()方法返回的是否还有下一个元素,它是一个布尔值。
马老师为ArrayList实现了Iterator组件,他是用内部类ArrayListIterator继承Iterator接口实现的,具体代码如下
public class ArrayList implements Collection {
Object[] objects = new Object[10];
int index = 0;
public void add(Object o) {
if(index == objects.length) {
Object[] newObjects = new Object[objects.length * 2];
System.arraycopy(objects, 0, newObjects, 0, objects.length);
objects = newObjects;
}
objects[index] = o;
index ++;
}
public int size() {
return index;
}
public Iterator iterator() {
return new ArrayListIterator();
}
private class ArrayListIterator implements Iterator {
private int currentIndex = 0;
@Override
public boolean hasNext() {
if(currentIndex >= index) return false;
else return true;
}
@Override
public Object next() {
Object o = objects[currentIndex];
currentIndex ++;
return o;
}
}
}
我把链表的Iterator也简单实现了一下,代码如下:
package com.bjsxt.dp.iterator;
import com.bjsxt.dp.iterator.Collection;
public class LinkedList implements Collection {
Node head = null;
Node tail = null;
int size = 0;
public void add(Object o) {
Node n = new Node(o, null);
if(head == null) {
head = n;
tail = n;
}
tail.setNext(n);
tail = n;
size ++;
}
public int size() {
return size;
}
@Override
public Iterator iterator() {
return new LinkedListIterator();
}
private class LinkedListIterator implements Iterator {
private Node currentNode = head;
@Override
public boolean hasNext() {
if(currentNode==null) return false;
else return true;
}
@Override
public Object next() {
Object o = currentNode.getData();
currentNode = currentNode.getNext();
return o;
}
}
}
Iterator it = c.iterator();
while(it.hasNext()) {
Object o = it.next();
System.out.print(o + " ");
}