1、ArrayList是实现了基于动态数组的数据库结构,LinkedList基于链表的数据结构。
2、对于随机访问get和set,ArrayList绝对优于LinkedList,因为LinkedList要移动指针。
3、对于新增和删除操作,LinkedList比较占优势,因为ArrayList要移动数据。
//示例代码:
static final int N = 50000;
static long timeList(List list) {
long start = System.currentTimeMillis();
Object o = new Object();
for (int i = 0; i < N; i++) {
list.add(0, o);
}
return System.currentTimeMillis() - start;
}
static long readList(List list) {
long start = System.currentTimeMillis();
for (int i = 0, j = list.size(); i < j; i++) {
}
return System.currentTimeMillis() - start;
}
static List addList(List list) {
Object o = new Object();
for (int i = 0; i < N; i++) {
list.add(0, o);
}
return list;
}
public static void main(String[] args) {
System.out.println("ArrayList添加" + N + "条耗时:" + timeList(new ArrayList()));
System.out.println("LinkedList添加" + N + "条耗时:" + timeList(new LinkedList()));
List list1 = addList(new ArrayList<>());
List list2 = addList(new LinkedList<>());
System.out.println("ArrayList查找" + N + "条耗时:" + readList(list1));
System.out.println("LinkedList查找" + N + "条耗时:" + timeList(list2));
}
测试运行结果如下:
由此可以看出ArrayList更适合读取数据,LinkedList更适合添加或删除数据。