ArrayList与LinkedList-插入时间 [英] ArrayList v.s. LinkedList - inserting time

问题描述

分别跑步时:

package containers;

import java.util.*;

    public static void main(String[] args) {

    List<Integer> arLst = new ArrayList<Integer>();
    List<Integer> lnLst = new LinkedList<Integer>();

    long start = System.currentTimeMillis();

    for (int i = 0; i < 10000000; i++) {
        arLst.add(i);
    }

    System.out.println("Array list: "+Long.toString(System.currentTimeMillis()-start));

    start = System.currentTimeMillis();

    for (int i = 0; i < 10000000; i++) {
        lnLst.add(i);
    }

    System.out.println("Linked list: "+Long.toString(System.currentTimeMillis()-start));
}

我得到的执行时间大致相同.我知道LinkedList的添加时间应该更快.我不知道为什么.(这对于中间插入和最后一个插入都是有意义的-因为数组在O(1)中知道插入位置，不像我记得的那样，LinkedList必须遍历整个列表).

I get roughly the same executing time. I know that Adding time should be faster for LinkedList. I wonder why.. (It makes sense that both for middle insertinon and last elemnt - since arrays know in O(1) where to insert, unlike LinkedList that has to go through the whole list, as I recall).

推荐答案

您的代码与您的解释有所不同.但是，这是您问题的答案:

Your code differs from your explanation. However, here is the answer to your question:

ArrayList与LinkedList

这篇关于ArrayList与LinkedList-插入时间的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！