public class ArrayList<E> extends AbstractList<E>  implements List<E>, RandomAccess, Cloneable, java.io.Serializable
{
 //默認(rèn)的數(shù)組大小
 private static final int DEFAULT_CAPACITY = 10;

 private static final Object[] EMPTY_ELEMENTDATA = {};
 
 private static final Object[] DEFAULTCAPACITY_EMPTY_ELEMENTDATA = {};
 //
 private int size;
 //這個(gè)就是ArrayList中的數(shù)組，所有對(duì)ArrayList的操作實(shí)際上是對(duì)該數(shù)組的操作
 transient Object[] elementData;

 public ArrayList() {
    this.elementData = DEFAULTCAPACITY_EMPTY_ELEMENTDATA;
 }
 
 public boolean add(E e) {
  ensureCapacityInternal(size + 1);
  elementData[size++] = e;
  return true;
  }

 private void ensureCapacityInternal(int minCapacity) {
    //如果當(dāng)前數(shù)組為空,則取默認(rèn)容量值和minCapacity的較大值
  if (elementData == DEFAULTCAPACITY_EMPTY_ELEMENTDATA) {
        minCapacity = Math.max(DEFAULT_CAPACITY, minCapacity);
  }

  ensureExplicitCapacity(minCapacity);
 }

 private void ensureExplicitCapacity(int minCapacity) {
   modCount++;

  // overflow-conscious code
  if (minCapacity - elementData.length > 0)
        grow(minCapacity);
 }

 private void grow(int minCapacity) {
    // overflow-conscious code
  int oldCapacity = elementData.length;
  int newCapacity = oldCapacity + (oldCapacity >> 1);
  if (newCapacity - minCapacity < 0)
        newCapacity = minCapacity;
  if (newCapacity - MAX_ARRAY_SIZE > 0)
        newCapacity = hugeCapacity(minCapacity);
  // minCapacity is usually close to size, so this is a win:
   elementData = Arrays.copyOf(elementData, newCapacity);
 }

 private static int hugeCapacity(int minCapacity) {
    if (minCapacity < 0) // overflow
         throw new OutOfMemoryError();
    return (minCapacity > MAX_ARRAY_SIZE) ?  Integer.MAX_VALUE :MAX_ARRAY_SIZE;
 }