ArrayList与LinkedList模拟实现

为多个容器定义接口规范容器的方法：

public interface Collection {

void add(Object o);
int size();
Iterator iterator();

}

模拟ArrayList:
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;
}

}
}

模拟LinkedListt:

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 null;
}
}

链表节点结构：

public class Node {
public Node(Object data, Node next) {
super();
this.data = data;
this.next = next;
}

public Object getData() {
return data;
}
public void setData(Object data) {
this.data = data;
}
public Node getNext() {
return next;
}
public void setNext(Node next) {
this.next = next;
}
private Object data;
private Node next;
}