ArrayList和LinkedList效率问题,一个demo看懂?

该博客通过代码示例对比了ArrayList和LinkedList在不同操作(如首元素添加、设置和删除,末元素操作以及中间位置操作)下的性能差异。结果显示,LinkedList在插入和删除首元素上具有优势,而ArrayList在其他位置的操作效率更高。此外,文章提醒注意在特定场景下选择合适的数据结构以优化程序性能。
摘要由CSDN通过智能技术生成

ArrayList和LinkedList效率问题,一个demo看懂?

import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;

public class Test {
	public static void main(String[] args) {
		List<String> al = new ArrayList<String>();
		List<String> ll = new LinkedList<String>();
		int i = 0;
		while(i<10000000) {
			al.add(String.valueOf(i));
			ll.add(String.valueOf(i));
			i++;
		}
		
		int size = al.size()-1;
		// 比较第一位add
		long currentTimeMillis = System.currentTimeMillis();
		al.add(0, "1");
		System.out.println("array Let's start with the first one add: " + (System.currentTimeMillis() - currentTimeMillis));
		
		currentTimeMillis = System.currentTimeMillis();
		ll.add(0, "1");
		System.out.println("linked Let's start with the first one add: " + (System.currentTimeMillis() - currentTimeMillis));

		// 比较第一位set
		currentTimeMillis = System.currentTimeMillis();
		al.set(0, "1");
		System.out.println("array Let's start with the first one set: " + (System.currentTimeMillis() - currentTimeMillis));
		
		currentTimeMillis = System.currentTimeMillis();
		ll.set(0, "1");
		System.out.println("linked Let's start with the first one set: " + (System.currentTimeMillis() - currentTimeMillis));

		// 比较第一位del
		currentTimeMillis = System.currentTimeMillis();
		al.remove(0);
		System.out.println("array Let's start with the first one del: " + (System.currentTimeMillis() - currentTimeMillis));
		
		currentTimeMillis = System.currentTimeMillis();
		ll.remove(0);
		System.out.println("linked Let's start with the first one del: " + (System.currentTimeMillis() - currentTimeMillis));
		
		// 比较最后一位add
		currentTimeMillis = System.currentTimeMillis();
		al.add("1");
		System.out.println("array Let's start with the last one add: " + (System.currentTimeMillis() - currentTimeMillis));
		
		currentTimeMillis = System.currentTimeMillis();
		ll.add("1");
		System.out.println("linked Let's start with the last one add: " + (System.currentTimeMillis() - currentTimeMillis));

		// 比较最后一位set
		currentTimeMillis = System.currentTimeMillis();
		al.set(size, "1");
		System.out.println("array Let's start with the last one set: " + (System.currentTimeMillis() - currentTimeMillis));
		
		currentTimeMillis = System.currentTimeMillis();
		ll.set(size, "1");
		System.out.println("linked Let's start with the last one set: " + (System.currentTimeMillis() - currentTimeMillis));

		// 比较最后一位del
		currentTimeMillis = System.currentTimeMillis();
		al.remove(size);
		System.out.println("array Let's start with the last one del: " + (System.currentTimeMillis() - currentTimeMillis));
		
		currentTimeMillis = System.currentTimeMillis();
		ll.remove(size);
		System.out.println("linked Let's start with the last one del: " + (System.currentTimeMillis() - currentTimeMillis));

		// 比较1/3处add
		size = size/3;
		currentTimeMillis = System.currentTimeMillis();
		al.add(size, "1");
		System.out.println("array Let's start with the " + size + " add: " + (System.currentTimeMillis() - currentTimeMillis));
		
		currentTimeMillis = System.currentTimeMillis();
		ll.add(size, "1");
		System.out.println("linked Let's start with the " + size + " add: " + (System.currentTimeMillis() - currentTimeMillis));

		// 比较1/3处set
		currentTimeMillis = System.currentTimeMillis();
		al.set(size, "1");
		System.out.println("array Let's start with the " + size + " set: " + (System.currentTimeMillis() - currentTimeMillis));
		
		currentTimeMillis = System.currentTimeMillis();
		ll.set(size, "1");
		System.out.println("linked Let's start with the " + size + " set: " + (System.currentTimeMillis() - currentTimeMillis));

		// 比较1/3处del
		currentTimeMillis = System.currentTimeMillis();
		al.remove(size);
		System.out.println("array Let's start with the " + size + " del: " + (System.currentTimeMillis() - currentTimeMillis));
		
		currentTimeMillis = System.currentTimeMillis();
		ll.remove(size);
		System.out.println("linked Let's start with the " + size + " del: " + (System.currentTimeMillis() - currentTimeMillis));
		
	}
}

array Let's start with the first one add: 7
linked Let's start with the first one add: 0
array Let's start with the first one set: 0
linked Let's start with the first one set: 0
array Let's start with the first one del: 8
linked Let's start with the first one del: 0
array Let's start with the last one add: 0
linked Let's start with the last one add: 0
array Let's start with the last one set: 0
linked Let's start with the last one set: 0
array Let's start with the last one del: 0
linked Let's start with the last one del: 0
array Let's start with the 6666666 add: 2
linked Let's start with the 6666666 add: 33
array Let's start with the 6666666 set: 0
linked Let's start with the 6666666 set: 33
array Let's start with the 6666666 del: 3
linked Let's start with the 6666666 del: 35

友情提示:三分之一处的比较是个坑。

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值