ArrayList初始容量及扩容概述

初始容量

结论: new ArrayList<>();
容量是 transient Object[] elementData;

private static final Object[] DEFAULTCAPACITY_EMPTY_ELEMENTDATA = {};

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

就是这个空数组,所以容量为0

add扩容

先看add方法

public boolean add(E e) {
        ensureCapacityInternal(size + 1);  // Increments modCount!!
        elementData[size++] = e;
        return true;
    }

再看其中的 ensureCapacityInternal 方法

因为上文new ArrayList<>(); 的时候 elementData 被赋值 DEFAULTCAPACITY_EMPTY_ELEMENTDATA
所以if条件成立 minCapacity = 10
即初始长度0,第一次add的时候长度变成10
如果只是想知道这个那看到这里就行了,接下来细化一下这个10是如何赋值和扩容的

private void ensureCapacityInternal(int minCapacity) {
        if (elementData == DEFAULTCAPACITY_EMPTY_ELEMENTDATA) {
            minCapacity = Math.max(DEFAULT_CAPACITY, minCapacity);
        }

        ensureExplicitCapacity(minCapacity);
    }

这里 elementData = Arrays.copyOf(elementData, newCapacity);
这一行就是将旧的数据复制进新的数组中去

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);
    }