ArrayList、LinkedList哪家强，据说90%人都不知道(1)

《一线大厂Java面试题解析+核心总结学习笔记+最新讲解视频+实战项目源码》，点击传送门，即可获取！

Long time2 = System.currentTimeMillis();

System.out.println(“add----time:” + (time2 - time1));

for (int i = 0; i < list.size(); i++) {

list.remove(i);

i–;

}

Long time3 = System.currentTimeMillis();

System.out.println(“remove----time:” + (time3 - time2));

}

结果：

add----time:5

remove----time:566

// LinkedList正序坐标删除

public static void main(String[] args) {

List list = new LinkedList<>();

int size = 10 * 10000;

Long time1 = System.currentTimeMillis();

for (int i = 0; i < size; i++) {

list.add(i);

}

Long time2 = System.currentTimeMillis();

System.out.println(“add----time:” + (time2 - time1));

for (int i = 0; i < list.size(); i++) {

list.remove(i);

i–;

}

Long time3 = System.currentTimeMillis();

System.out.println(“remove----time:” + (time3 - time2));

}

结果：

add----time:4

remove----time:3

// LinkedList逆序坐标删除

public static void main(String[] args) {

List list = new LinkedList<>();

int size = 10 * 10000;

Long time1 = System.currentTimeMillis();

for (int i = 0; i < size; i++) {

list.add(i);

}

Long time2 = System.currentTimeMillis();

System.out.println(“add----time:” + (time2 - time1));

for (int i = 0; i < list.size(); i++) {

list.remove(list.size() - i - 1);

i–;

}

Long time3 = System.currentTimeMillis();

System.out.println(“remove----time:” + (time3 - time2));

}

结果：

add----time:6

remove----time:3

// LinkedList逆序对象删除

public static void main(String[] args) {

List list = new LinkedList<>();

int size = 10 * 10000;

Long time1 = System.currentTimeMillis();

for (int i = 0; i < size; i++) {

list.add(i);

}

Long time2 = System.currentTimeMillis();

System.out.println(“add----time:” + (time2 - time1));

for (int i = 0; i < list.size(); i++) {

Integer integer = list.get(list.size() - i - 1);

list.remove(integer);

i–;

}

Long time3 = System.currentTimeMillis();

System.out.println(“remove----time:” + (time3 - time2));

}

结果：

add----time:6

remove----time:12107

ArrayList因为添加触发到扩容，最终执行的是System.arraycopy本地方法，执行速度相对较快，但删除需要进行数据移动，所以执行效率低。

LinkedList正序坐标删除和逆序坐标删除，时间效率都一样，逆序坐标删除是因为程序做了特殊处理，但是如果是逆序对象删除的话，运行效率就会特别差，原理后面再介绍。

1.3、内存使用情况如何？

public static void main(String[] args) {

List list = new ArrayList<>();

int size = 100 * 10000;

for (int i = 0; i < size; i++) {

list.add(i);

}

System.out.println(“memory:”+ RamUsageEstimator.humanSizeOf(list));

}

结果：memory:19.9 MB

public static void main(String[] args) {

List list = new LinkedList<>();

int size = 100 * 10000;

for (int i = 0; i < size; i++) {

list.add(i);

}

System.out.println(“memory:”+ RamUsageEstimator.humanSizeOf(list));

}

结果：memory:38.1 MB

同等size大小的集合，显然LinkedList要比ArrayList更吃内存，所以如果是超大集合存储的话，要留意内存使用情况。

二、源码分析

2.1、ArrayList源码

2.1.1、add()

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

}

public static <T,U> T[] copyOf(U[] original, int newLength, Class<? extends T[]> newType) {

@SuppressWarnings(“unchecked”)

T[] copy = ((Object)newType == (Object)Object[].class)

? (T[]) new Object[newLength]

(T[]) Array.newInstance(newType.getComponentType(), newLength);

System.arraycopy(original, 0, copy, 0,

Math.min(original.length, newLength));

return copy;

}

ArrayList的add()方法本质就是数组中设置值，这没什么好说的，重点在于扩容，当数组size达到扩容标准后，就会触发System.arraycopy进行数组复制，这对时间和空间上都会有一定的影响。

2.1.2、remove()

// 坐标删除

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;

}

// 对象删除

public boolean remove(Object o) {

if (o == null) {

for (int index = 0; index < size; index++)

if (elementData[index] == null) {

fastRemove(index);

return true;

}

} else {

for (int index = 0; index < size; index++)

if (o.equals(elementData[index])) {

fastRemove(index);

return true;

}

}

return false;

}

private void fastRemove(int index) {

modCount++;

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

}

ArrayList的remove如果是对象删除的话也是需要循环的，删除之后还需要再执行一次System.arraycopy复制操作，所以在时间和空间上面效率都很差。如果是坐标删除的话，就不需要进行循环，直接System.arraycopy即可。

2.2、LinkedList原理

2.2.1、add()

void linkLast(E e) {

final Node l = last;

final Node newNode = new Node<>(l, e, null);

last = newNode;

if (l == null)

first = newNode;

else

l.next = newNode;

size++;

modCount++;

}

LinkedList的add()方法没什么可介绍的，就是链表节点的添加。

2.2.2、remove()

// 坐标删除

public E remove(int index) {

checkElementIndex(index);

return unlink(node(index));

}

Node node(int index) {

// assert isElementIndex(index);

if (index < (size >> 1)) {

架构学习资料

由于篇幅限制小编，pdf文档的详解资料太全面，细节内容实在太多啦，所以只把部分知识点截图出来粗略的介绍，每个小节点里面都有更细化的内容！
《一线大厂Java面试题解析+核心总结学习笔记+最新讲解视频+实战项目源码》，点击传送门，即可获取！
Node node(int index) {

// assert isElementIndex(index);

if (index < (size >> 1)) {

架构学习资料

[外链图片转存中…(img-8PJpG3SH-1714467816133)]

[外链图片转存中…(img-LlBZ4yXN-1714467816134)]

[外链图片转存中…(img-8v8iHY31-1714467816134)]

[外链图片转存中…(img-mrtxmSBK-1714467816134)]

[外链图片转存中…(img-PWPK1mBu-1714467816134)]

由于篇幅限制小编，pdf文档的详解资料太全面，细节内容实在太多啦，所以只把部分知识点截图出来粗略的介绍，每个小节点里面都有更细化的内容！
《一线大厂Java面试题解析+核心总结学习笔记+最新讲解视频+实战项目源码》，点击传送门，即可获取！