ArrayList数组扩容

ArrayList的默认的无参构造方法为：

private static final Object[] DEFAULTCAPACITY_EMPTY_ELEMENTDATA = {}; 

public ArrayList() {
    this.elementData = DEFAULTCAPACITY_EMPTY_ELEMENTDATA;
}

DEFAULTCAPACITY_EMPTY_ELEMENTDATA是一个空数组，所以ArrayList默认创建一个初始长度为0的空数组。
调用add()方法向ArrayList添加元素时，先检查数组长度的大小，如果为默认的空数组，则改变数组的长度为10，（private static final int DEFAULT_CAPACITY = 10;）

if (elementData == DEFAULTCAPACITY_EMPTY_ELEMENTDATA) {
            return Math.max(DEFAULT_CAPACITY, minCapacity);
        }

如果elementData 已经无法存放元素（minCapacity - elementData.length > 0），则调用grow()方法对数组进行扩容

private void ensureExplicitCapacity(int minCapacity) {
        modCount++;
        // overflow-conscious code
        if (minCapacity - elementData.length > 0)
            grow(minCapacity);
    }

将数组的长度扩大至原来的1.5倍(int oldCapacity = elementData.length; int newCapacity = oldCapacity + (oldCapacity >> 1);)

 private static final int MAX_ARRAY_SIZE = Integer.MAX_VALUE - 8;
 private void grow(int minCapacity) {
        // overflow-conscious code
        int oldCapacity = elementData.length;
        int newCapacity = oldCapacity + (oldCapacity >> 1);
        // 比较newCapacity 和minCapacity，将较大的值设为数组长度（主要用于第一次添加元素和使用AddAll()方法添加元素）
        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:
        // 使用Arrays.copyOf()方法进行重新赋值
        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;
    }