ArrayList與LinkedList的性能對比

ArrayList與LinkedList都是繼承至Collection對象,內(nèi)部實(shí)現(xiàn)導(dǎo)致性能方面存在一定的區(qū)別

10年積累的成都做網(wǎng)站、網(wǎng)站建設(shè)、外貿(mào)營銷網(wǎng)站建設(shè)經(jīng)驗(yàn)，可以快速應(yīng)對客戶對網(wǎng)站的新想法和需求。提供各種問題對應(yīng)的解決方案。讓選擇我們的客戶得到更好、更有力的網(wǎng)絡(luò)服務(wù)。我雖然不認(rèn)識(shí)你，你也不認(rèn)識(shí)我。但先網(wǎng)站設(shè)計(jì)后付款的網(wǎng)站建設(shè)流程，更有蓮池免費(fèi)網(wǎng)站建設(shè)讓你可以放心的選擇與我們合作。

  1. 插入性能對比

    private final static int COUNT = 10000000;

private static long insertObject(List<Object> list) {
    Object obj = new Object();
    long startTime = System.currentTimeMillis();
    for (int i = 0; i < COUNT; i++) {
        list.add(obj);
    }
    long endTime = System.currentTimeMillis();
    return endTime - startTime;
}

public static void main(String[] args) {
    int initCount = (int) (COUNT * 1.5);
    System.out.println("ArrayList 增加" + COUNT + "條數(shù)據(jù),耗時(shí):" + insertObject(new ArrayList<Object>(initCount)));
    System.out.println("LinkedList 增加" + COUNT + "條數(shù)據(jù),耗時(shí):" + insertObject(new LinkedList<Object>()));
}

    上述代碼得出下列結(jié)果:
    ArrayList與LinkedList的性能對比

  2. 查詢性能對比
    private final static int COUNT = 1000000;

    private static Map<String, Object> insertObject(List<Object> list) {
        User user = new User();
        long startTime = System.currentTimeMillis();
        for (int i = 0; i < COUNT; i++) {
            user.setId(i);
            user.setName("i:" + i);
            user.setAge(i);
            list.add(user);
        }
        long endTime = System.currentTimeMillis();
        Map result = new HashMap<String, Object>();
        result.put("time", endTime - startTime);
        result.put("list", list);
        return result;
    }

    private static long readObject(List<User> list) {
        long startTime = System.currentTimeMillis();
        for (User user : list) {

        }
        long endTime = System.currentTimeMillis();
        return endTime - startTime;
    }

    public static void main(String[] args) {
        // 插入
        int initCount = (int) (COUNT * 1.5);
        Map<String, Object> arrayListResult = insertObject(new ArrayList<Object>());
        Map<String, Object> linkedListResult = insertObject(new LinkedList<Object>());
        System.out.println("ArrayList 增加" + COUNT + "條數(shù)據(jù),耗時(shí):" + arrayListResult.get("time"));
        System.out.println("LinkedList 增加" + COUNT + "條數(shù)據(jù),耗時(shí):" + linkedListResult.get("time"));

        // 讀取
        System.out.println("ArrayList 查詢" + COUNT + "條數(shù)據(jù),耗時(shí):" + readObject((List<User>) arrayListResult.get("list")));
        System.out.println("LinkedList 查詢" + COUNT + "條數(shù)據(jù),耗時(shí):" + readObject((List<User>) linkedListResult.get("list")));
    }

結(jié)果如下所示:
ArrayList與LinkedList的性能對比

3.LinkedList的優(yōu)勢


    static final int N = 500000;

    static long timeList(List<Object> list) {
        long start = System.currentTimeMillis();
        Object o = new Object();
        for (int i = 0; i < N; i++) {
            list.add(0, o);
        }
        long endTime = System.currentTimeMillis();
        return endTime - start;
    }

    static long readList(List list) {
        long start = System.currentTimeMillis();
        for (int i = 0, j = list.size(); i < j; i++) {

        }
        return System.currentTimeMillis() - start;
    }

    static List addList(List list) {
        Object o = new Object();
        for (int i = 0; i < N; i++) {
            list.add(0, o);
        }
        return list;
    }

    public static void main(String[] args) {
        System.out.println("ArrayList添加" + N + "條耗時(shí)：" + timeList(new ArrayList<Object>()));
        System.out.println("LinkedList添加" + N + "條耗時(shí)：" + timeList(new LinkedList<Object>()));

        List list1 = addList(new ArrayList<>());
        List list2 = addList(new LinkedList<>());
        System.out.println("ArrayList查找" + N + "條耗時(shí)：" + readList(list1));
        System.out.println("LinkedList查找" + N + "條耗時(shí)：" + readList(list2));
    }

結(jié)果:
ArrayList與LinkedList的性能對比

LinkedList的優(yōu)勢在于頭部插入,而不是隨機(jī)插入,在使用過程中需要根據(jù)自己的需求進(jìn)行選擇!!!

當(dāng)前文章：ArrayList與LinkedList的性能對比
網(wǎng)頁網(wǎng)址：http://bm7419.com/article2/jddioc.html

成都網(wǎng)站建設(shè)公司_創(chuàng)新互聯(lián)，為您提供微信小程序、網(wǎng)站設(shè)計(jì)、電子商務(wù)、品牌網(wǎng)站制作、網(wǎng)頁設(shè)計(jì)公司、外貿(mào)網(wǎng)站建設(shè)

廣告

聲明：本網(wǎng)站發(fā)布的內(nèi)容（圖片、視頻和文字）以用戶投稿、用戶轉(zhuǎn)載內(nèi)容為主，如果涉及侵權(quán)請盡快告知，我們將會(huì)在第一時(shí)間刪除。文章觀點(diǎn)不代表本網(wǎng)站立場，如需處理請聯(lián)系客服。電話：028-86922220；郵箱：631063699@qq.com。內(nèi)容未經(jīng)允許不得轉(zhuǎn)載，或轉(zhuǎn)載時(shí)需注明來源： 創(chuàng)新互聯(lián)

成都網(wǎng)站建設(shè)公司