ArrayList(int initialCapacity)：指定容量
ArrayList()：構(gòu)造一個(gè)默認(rèn)容量為10的ArrayList
ArrayList(Collection<? extends E> c)：構(gòu)造一個(gè)指定Collection的ArrayList

 // 添加指定元素到list末尾
  public boolean add(E e) {
    // 檢查是否需要擴(kuò)容
    ensureCapacityInternal(size + 1); // Increments modCount!!
    // 賦值
    elementData[size++] = e;
    return true;
  }
  private void ensureCapacityInternal(int minCapacity) {
    if (elementData == DEFAULTCAPACITY_EMPTY_ELEMENTDATA) {
      // 比較默認(rèn)的容量10和傳入的容量，返回大點(diǎn)的數(shù)
      minCapacity = Math.max(DEFAULT_CAPACITY, minCapacity);
    }
    //擴(kuò)容
    ensureExplicitCapacity(minCapacity);
  } 
  private void ensureExplicitCapacity(int minCapacity) {
    // 記錄修改次數(shù)
    modCount++;
    // overflow-conscious code
    if (minCapacity - elementData.length > 0)
      grow(minCapacity);
  }
  private void grow(int minCapacity) {
    // overflow-conscious code
    // 記錄當(dāng)前l(fā)ist的容量
    int oldCapacity = elementData.length;
    // 擴(kuò)展為原來(lái)的1.5倍
    int newCapacity = oldCapacity + (oldCapacity >> 1);
    // 如果擴(kuò)展1.5倍還不能滿足，直接擴(kuò)展為需求值
    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);
  }

  public E get(int index) {
    rangeCheck(index);
    return elementData(index);
  }
  public E set(int index, E element) {
    rangeCheck(index);
    E oldValue = elementData(index);
    elementData[index] = element;
    return oldValue;
  }

public E remove(int index) {
  rangeCheck(index);
  modCount++;
  E oldValue = elementData(index);
  int numMoved = size - index - 1;
  if (numMoved > 0)
    System.arraycopy(elementData, index+1, elementData, index,
             numMoved);
  elementData[--size] = null; // clear to let GC do its work
  return oldValue;
}