比较 arraylist 和 linkedlist...我的代码错误吗？

发布于 2024-10-23 19:51:19 字数 699 浏览 2 评论 0原文

我在另一个问题中问，为什么在读取文件和创建列表时，数组列表似乎比链接列表更快。我现在尝试添加到列表的前面或列表的后面。 Arraylist 仍然更快。

我只是想确保我正确使用这些东西。这就是我正在做的：

public class LinkedListTest {

    private List<String> Names;

    public LinkedListTest(){
            Names = new LinkedList<String>();
    }

然后我只使用链接列表方法，即“Names.add(strings)”。当我测试数组列表时，它几乎是相同的：

public class ArrayListTest {

    private List<String> Names;

    public ArrayListTest(){
            Names = new ArrayList<String>();
    }

我做得对吗？事实上，在比较速度时，将构造函数方法中的列表类型从 ArrayList 更改为 LinkedList 几乎是我在代码中所做的唯一更改。这是正确的做法吗？

编辑：哦，我只是在 add 函数之前和之后执行 System.currentTimeMillis() 来测量时间。

原文

I asked in another question why arraylist seemed faster than linkedlist when reading a file and to create the lists. I've now tried adding to the front of the list or the back of the list. Arraylist was still faster.

i just want to make sure i'm using these things right. here's what i'm doing:

public class LinkedListTest {

    private List<String> Names;

    public LinkedListTest(){
            Names = new LinkedList<String>();
    }

Then I just using linkedlist methods ie "Names.add(strings)". And when I tested arraylists, it's nearly identical:

public class ArrayListTest {

    private List<String> Names;

    public ArrayListTest(){
            Names = new ArrayList<String>();
    }

Am I doing it right? In fact, changing the list type in the constructor method from ArrayList to LinkedList was pretty much the ONLY change I made in the code when comparing the speeds. Is that the right way to go about it?

EDIT:
Oh, and I just do System.currentTimeMillis() before and after the add function to measure time.

分享到QQ

分享到微博