存储性能 - 速度测试代码_code 存储性能检测代码顺序读顺序写-优快云博客

本文链接：https://blog.youkuaiyun.com/cuitang1031/article/details/6509683

本文通过具体代码示例对比了Java中ArrayList, HashMap及LinkedList在不同操作场景下的性能表现，包括顺序添加元素和指定位置添加元素两种情况。

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

ArrayListTest.java

package qqq;

import java.util.ArrayList;

public class ArrayListTest {

    /**
    * @param args
    */
    public static void main(String[] args) {

        long startTimeAL1;
        long endTimeAL1;
        long startTimeAL2;
        long endTimeAL2;
        //AL顺序添加500000
        startTimeAL1 = System.currentTimeMillis();
        ArrayList aL = new ArrayList();
        for(int i=0;i<50000; i++){
            aL.add("000");
        }
        endTimeAL1 = System.currentTimeMillis();
        //AL前段添加
        startTimeAL2 = System.currentTimeMillis();
        ArrayList aL2 = new ArrayList();
        for(int i=0;i<50000; i++){
            aL.add(1,"000");
        }
        endTimeAL2 = System.currentTimeMillis();

        System.out.println("顺序添加50000条数据耗时："+(endTimeAL1-startTimeAL1)+"ms");
        System.out.println("顺序添加50000条数据耗时："+(endTimeAL2-startTimeAL2)+"ms");
    }
}

//********************************************************************************

HashMapTest.java

package qqq;

import java.util.HashMap;

public class HashMapTest {

    /**
    * @param args
    */
    public static void main(String[] args) {

        long startTimeAL1;
        long endTimeAL1;
        long startTimeAL2;
        long endTimeAL2;
        //AL顺序添加500000
        startTimeAL1 = System.currentTimeMillis();
        HashMap hM1 = new HashMap();
        for(int i=0;i<50000; i++){
            hM1.put(i,"000");
        }
        endTimeAL1 = System.currentTimeMillis();
        //AL前段添加
        startTimeAL2 = System.currentTimeMillis();
        HashMap hM2 = new HashMap();
        for(int i=0;i<50000; i++){
            hM2.put(50000-i, "000");
        }
        endTimeAL2 = System.currentTimeMillis();

        //System.out.println(hM1.size());
        //System.out.println(hM2.size());
        System.out.println("顺序添加50000条数据耗时："+(endTimeAL1-startTimeAL1)+"ms");
        System.out.println("顺序添加50000条数据耗时："+(endTimeAL2-startTimeAL2)+"ms");

    }
}

//********************************************************************************

LinkedListTest.java

package qqq;

import java.util.ArrayList;

public class LinkedListTest {

    /**
    * @param args
    */
    public static void main(String[] args) {

        long startTimeAL1;
        long endTimeAL1;
        long startTimeAL2;
        long endTimeAL2;
        //AL顺序添加500000
        startTimeAL1 = System.currentTimeMillis();
        ArrayList aL = new ArrayList();
        for(int i=0;i<50000; i++){
            aL.add("000");
        }
        endTimeAL1 = System.currentTimeMillis();
        //AL前段添加
        startTimeAL2 = System.currentTimeMillis();
        ArrayList aL2 = new ArrayList();
        for(int i=0;i<50000; i++){
            aL.add(1,"000");
        }
        endTimeAL2 = System.currentTimeMillis();


        System.out.println("顺序添加50000条数据耗时："+(endTimeAL1-startTimeAL1)+"ms");
        System.out.println("顺序添加50000条数据耗时："+(endTimeAL2-startTimeAL2)+"ms");

    }
}