arrayList 和 LinkedList 区别_long end=0是什么意思-优快云博客

本文链接：https://blog.youkuaiyun.com/jim_007/article/details/120707233

本文通过代码实测比较ArrayList和LinkedList在添加、删除和插入操作上的性能差异。实验结果显示ArrayList在添加元素和删除末尾元素上较快，而LinkedList在插入和删除中间元素上表现更优。分析指出查找操作是影响效率的关键因素。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

public static void main(String[] args) {
        long end = 0;
        long start = 0;
        int MAX = 100000;

        // ArrayList新增
        List<Integer> arrayList = new ArrayList();
        start = System.nanoTime();
        for (int x = 0; x < MAX; x++) {
            arrayList.add(x);
        }
        end = System.nanoTime();
        System.out.println("ArrayList新增【10w元素】用时：" + (end - start));

        // LinkedList新增
        List<Integer> linkedList = new LinkedList();
        start = System.nanoTime();
        for (int x = 0; x < MAX; x++) {
            linkedList.add(x);
        }
        end = System.nanoTime();
        System.out.println("LinkedList新增【10w元素】用时：" + (end - start));

        start = System.nanoTime();
        arrayList.add(300);
        end = System.nanoTime();
        System.out.println("ArrayList【插入】元素用时：" + (end - start));


        start = System.nanoTime();
        linkedList.add(300);
        end = System.nanoTime();
        System.out.println("linkedList【插入】元素用时：" + (end - start));



        start = System.nanoTime();
        arrayList.remove(MAX);
        end = System.nanoTime();
        System.out.println("ArrayList删除【末尾】元素用时：" + (end - start));


        start = System.nanoTime();
        ((LinkedList<Integer>) linkedList).removeLast();
        end = System.nanoTime();
        System.out.println("linkedList删除【末尾】元素用时：" + (end - start));


        start = System.nanoTime();
        arrayList.remove(1000);
        end = System.nanoTime();
        System.out.println("ArrayList删除【中间】元素用时：" + (end - start));


        start = System.nanoTime();
        linkedList.remove(1000);
        end = System.nanoTime();
        System.out.println("linkedList删除【中间】元素用时：" + (end - start));

    }

下图是我跑的运行结果：