Java中ArrayList扩容机制

    private static final long serialVersionUID = 8683452581122892189L;

    private static final int DEFAULT_CAPACITY = 10;
    private static final Object[] EMPTY_ELEMENTDATA = {};
    private static final Object[] DEFAULTCAPACITY_EMPTY_ELEMENTDATA = {};
    transient Object[] elementData; // non-private to simplify nested class access
    private int size;//数组中包含的元素
    //有参构造函数
	public ArrayList(int initialCapacity) {
	       if (initialCapacity > 0) {
	           this.elementData = new Object[initialCapacity];
	       } else if (initialCapacity == 0) {
	           this.elementData = EMPTY_ELEMENTDATA;
	       } else {
	           throw new IllegalArgumentException("Illegal Capacity: "+
	                                              initialCapacity);
	       }
	   }

   //无参构造函数
    public ArrayList() {
        this.elementData = DEFAULTCAPACITY_EMPTY_ELEMENTDATA;
    }
    
	//涉及扩容
	public boolean add(E e) {
	    ensureCapacityInternal(size + 1);  // Increments modCount!!
	    elementData[size++] = e;
	    return true;
	}

    private void ensureCapacityInternal(int minCapacity) {
        ensureExplicitCapacity(calculateCapacity(elementData, minCapacity));
    }
    
    private static int calculateCapacity(Object[] elementData, int minCapacity) {
    if (elementData == DEFAULTCAPACITY_EMPTY_ELEMENTDATA) {
        return Math.max(DEFAULT_CAPACITY, minCapacity);
    }
    return 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);//1.5倍
        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;
    }

注：
@Native public static final int MAX_VALUE = 0x7fffffff;//2^31
private static final int MAX_ARRAY_SIZE = Integer.MAX_VALUE - 8;
总结：
minCapacity为指定容量和默认容量（10）的较大值
添加元素时，最小需要容量minCapacity=size+1（添加后的实际元素个数），当数组中实际元素个数大于数组长度时需要扩容
新的容量为数组长度的1.5倍
新的容量与minCapacity比较，若小于则新的容量为minCapacity
新的容量与MAX_ARRAY_SIZE比较，若大于则用minCapacity进行扩容：minCapacity<0溢出；minCapacity > MAX_ARRAY_SIZE新容量为为 Integer.MAX_VALUE ；否则新容量为MAX_ARRAY_SIZE。
Arrays.copyOf()//把一个数组的值完全覆盖给另一个数组
elementData[size++] = e;