目的
为了自己面试复习方便, 也做一个简单点的学习过程记录, 可能自己也不会看, 但是不影响我去记录.
资料来源
B站黑马机构老师讲解整理的大厂高频面试题, 可能对我不太适用.
https://www.bilibili.com/video/BV15b4y117RJ
扩容机制
- 无参构造, 初始容量为0
/**
* Constructs an empty list with an initial capacity of ten.
* 其实扩容后, 才是10, 这里就是一个空数组, 原作者这里搞一个注释, 说初始容量为10有点懵逼
*/
public ArrayList() {
this.elementData = DEFAULTCAPACITY_EMPTY_ELEMENTDATA;
}
/**
* Shared empty array instance used for default sized empty instances. We
* distinguish this from EMPTY_ELEMENTDATA to know how much to inflate when
* first element is added.
*/
private static final Object[] DEFAULTCAPACITY_EMPTY_ELEMENTDATA = {};
- 有参构造, ArrayList(int initialCapacity), 指定容量
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);
}
}
- 有参构造, ArrayList(Collection<? extends E> c), 数组的容量作为初始容量
public ArrayList(Collection<? extends E> c) {
elementData = c.toArray();
if ((size = elementData.length) != 0) {
// c.toArray might (incorrectly) not return Object[] (see 6260652)
if (elementData.getClass() != Object[].class)
elementData = Arrays.copyOf(elementData, size, Object[].class);
} else {
// replace with empty array.
this.elementData = EMPTY_ELEMENTDATA;
}
}
- add(Object o) 首次扩容为10, 再次扩容为上次的1.5倍
- addAll(Collection c). 没有元素时: Math.max(10, 实际元素个数), 有元素时 Math.max(原容量1.5倍, 实际元素个数)
private void grow(int minCapacity) {
// overflow-conscious code
int oldCapacity = elementData.length;
// 扩容1.5倍
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);
}