自定义一个动态数组（数组，链表两种方法实现）

数组实现：

import java.util.Arrays;

class MyArray<E>{
	private E[] elementData;
	private int size;
	private final static int DEFAULT_CAPACITY = 10;
	public MyArray(){
		//elementData = (E[]) new Object[DEFAULT_CAPACITY];
		this(DEFAULT_CAPACITY);
	}
	public MyArray(int initCap){
		elementData = (E[])new Object[initCap];
	}

	public add(E e){
		if(size == elementData.length){
			int oldCap = elementData.length;
			int newCap = oldCap + ((oldCap > 64)?oldCap:oldCap>>1);
			if(newCap > Integer.MAX_VALUE){
				thorw new IndexOutOfBoundsException("数组元素过多");
			}
			elementData = Arrays.copyOf(elementData,newCap);
		}
		elementData[size++] = e;
	}
}

链表实现：

public class MyArrayBasedOnLinkedList<E> {
	private class Node{
		E e;
		Node next;
		Node prev;
	}
	Node(E data,Node next,Node prev){
		this.data = data;
		this.head = head;
		this.tail = tail;
	}
	private int size;
	private Node head;
	private Node tail;
	
	//尾插
	public void add(E data){
		Node node = new Node(data,null,tail);
			//判断链表是否为空
			if(tail == null){
				head = tail = node;
			}
			//将当前节点指向上一个节点
			//node.prev = tail;
			//将当前链表的尾指针指向新节点
	        tail.next = node;
	        //再将新的节点设置为新的尾节点
	        tail = node;
	        size++;
   	}				
}