ArrayList和LinkedList

ArrayList和LinkedList

ArrayList和LinkedList的区别

1.ArrayList是基于数组的,LinkedList是双向链表.两个数据结构的逻辑关系是不一样的,物理存储方式不一样.

2.LinkedList比ArrayList而占内存,因为LinkedList的节点除了存储数据,还存储两个索引,一个指向前一个元素,一个执行后一个元素.

3.对于随机访问,ArrayList要优于LinkedList.

4.增删改查的操作速度对比

import java.util.*;

public class ArrayList和LinkedList对比 {
    private static Long size = 100000L;
    private static ArrayList<Integer> arrayList;
    private static LinkedList<Integer> linkedList;
    public static void main(String[] args) {
        //插入对比
        Map<String, Object> map2 = initLinkedListAndArrayList(size);
        map2.forEach((k,v)->{
            System.out.println(k+":"+v);
        });
        //查询对比
        Map<String, Object> map = selectTimeCompare(arrayList, linkedList);
        map.forEach((k,v)->{
            System.out.println(k+":"+v);
        });
        //删除对比
        Map<String, Object> map1 = deleteTimeCompare(arrayList, linkedList);
        map1.forEach((k,v)->{
            System.out.println(k+":"+v);
        });
        //修改对比
        Map<String, Object> map3 = updateTimeCompare(arrayList, linkedList);
        map3.forEach((k,v)->{
            System.out.println(k+":"+v);
        });
    }

    //更新速度对比
    private static Map<String,Object> updateTimeCompare(ArrayList<Integer> arrayList, LinkedList<Integer> linkedList) {
        Map<String, Object> params = new LinkedHashMap<>();
        long start = System.currentTimeMillis();
        for (int i = 0; i < arrayList.size(); i++) {
            arrayList.set(i,i);
        }
        long end = System.currentTimeMillis();
        params.put("arrayListUpdateTime", end - start);



        long start1 = System.currentTimeMillis();
        for (int i = 0; i < linkedList.size(); i++) {
            linkedList.set(i,i);
        }

        long end1 = System.currentTimeMillis();
        params.put("linkedListUpdateTime", end1 - start1);


        return params;
    }

    //删除速度对比
    public static Map<String, Object> deleteTimeCompare(ArrayList arrayList, LinkedList linkedList) {
        Map<String, Object> params = new LinkedHashMap<>();
        long start = System.currentTimeMillis();
        for (int i = 0; i < arrayList.size(); i++) {
            arrayList.remove(i);
        }
        long end = System.currentTimeMillis();
        params.put("arrayListDeleteTime", end - start);

        long start1 = System.currentTimeMillis();
        for (int i = 0; i < linkedList.size(); i++) {
            linkedList.remove(i);
        }
        long end1 = System.currentTimeMillis();

        params.put("linkedListDeleteTime", end1 - start1);
        return params;
    }

    //查询速度对比
    public static Map<String, Object> selectTimeCompare(ArrayList arrayList,LinkedList linkedList) {
        Map<String, Object> map = new LinkedHashMap<>();
        long start = System.currentTimeMillis();
        for (int i = 0; i <arrayList.size(); i++) {
            //知道索引查询值
            Object o = arrayList.get(i);
            //知道值查询索引
            arrayList.indexOf(o);
        }
        long end = System.currentTimeMillis();
        map.put("arrayListSelectTime", end - start);

        long start1 = System.currentTimeMillis();
        for (int i = 0; i < linkedList.size(); i++) {
            //知道索引查询值
            Object o = linkedList.get(i);
            //知道值查询索引
            int i1 = linkedList.indexOf(o);
        }
        long end1 = System.currentTimeMillis();
        map.put("linkedListSelectTime", end1 - start1);

        return map;

    }
    
    //初始化
    public static Map<String,Object> initLinkedListAndArrayList(Long size) {
        Map<String, Object> params = new LinkedHashMap<>();

        long start = System.currentTimeMillis();
        ArrayList<Integer> arrayList1 = new ArrayList<Integer>(size.intValue());
        for (int i = 0; i < size; i++) {
            arrayList1.add(i);
        }
        arrayList = arrayList1;
        long end = System.currentTimeMillis();
        params.put("arrayListInitTime", end - start);

        long start1 = System.currentTimeMillis();
        LinkedList<Integer> linkedList1 = new LinkedList<Integer>();
        for (int i = 0; i < size; i++) {
            linkedList1.add(i);
        }
        linkedList = linkedList1;
        long end1 = System.currentTimeMillis();
        params.put("linkedListInitTime", end1 - start1);
        return params;
    }

}

执行结果

arrayListInitTime:5
linkedListInitTime:3
arrayListSelectTime:3018
linkedListSelectTime:13480
arrayListDeleteTime:192
linkedListDeleteTime:1485
arrayListUpdateTime:3
linkedListUpdateTime:1235

当数据量越来越大的时候linkedList明显各方面不如arrayList
这个应该是跟复杂度有关系，算法知识准备不足，后面再做补充。