闲来无事,写了个小东西,对这两个LIST进行简单的比较,分别对他们执添加元素和查询操作,之中用了多态的思想,减少了一些重复的代码,下面是程序代码和输出结果。
import
java.util.
*
;
public class Test ... {
private static final int INSERT = 0;
private static final int SEARCH = 1;
private static int total = 500000;
private static Random random = new Random();
public static long test(List list,int flag)...{ //测试方法
long t1 = System.currentTimeMillis();
if(flag == 0)
insert(list);
else if (flag == 1)
search(list);
return System.currentTimeMillis() - t1;
}
public static void insert(List list)...{ //对list进行写入的方法
for(int i=0;i<total;i++)...{
list.add(new Integer(random.nextInt(10)));
}
}
public static void search(List list)...{ //对list进行查询的方法
for(int i=0;i<total;i++)...{
list.contains(new Integer(random.nextInt(10)));
}
}
public static void main(String[] args)...{
List arrayList = new ArrayList();
List linkedList = new LinkedList();
System.gc();
System.out.println("对ArrayList进行"+total+"次添加用时:"+test(arrayList,INSERT));
System.out.println("对LinkedList进行"+total+"次添加用时:"+test(linkedList,INSERT));
System.out.println("对ArrayList进行"+total+"次查询用时:"+test(arrayList,SEARCH));
System.out.println("对LinkedList进行"+total+"次查询用时:"+test(linkedList,SEARCH));
}
}
public class Test ... {
private static final int INSERT = 0;
private static final int SEARCH = 1;
private static int total = 500000;
private static Random random = new Random();
public static long test(List list,int flag)...{ //测试方法
long t1 = System.currentTimeMillis();
if(flag == 0)
insert(list);
else if (flag == 1)
search(list);
return System.currentTimeMillis() - t1;
}
public static void insert(List list)...{ //对list进行写入的方法
for(int i=0;i<total;i++)...{
list.add(new Integer(random.nextInt(10)));
}
}
public static void search(List list)...{ //对list进行查询的方法
for(int i=0;i<total;i++)...{
list.contains(new Integer(random.nextInt(10)));
}
}
public static void main(String[] args)...{
List arrayList = new ArrayList();
List linkedList = new LinkedList();
System.gc();
System.out.println("对ArrayList进行"+total+"次添加用时:"+test(arrayList,INSERT));
System.out.println("对LinkedList进行"+total+"次添加用时:"+test(linkedList,INSERT));
System.out.println("对ArrayList进行"+total+"次查询用时:"+test(arrayList,SEARCH));
System.out.println("对LinkedList进行"+total+"次查询用时:"+test(linkedList,SEARCH));
}
}
对ArrayList进行100000次添加用时:47
对LinkedList进行100000次添加用时:125
对ArrayList进行100000次查询用时:166
对LinkedList进行100000次查询用时:128
对ArrayList进行500000次添加用时:344
对LinkedList进行500000次添加用时:531
对ArrayList进行500000次查询用时:422
对LinkedList进行500000次查询用时:219
ArrayList是基于数组实现的,而LinkedList是基于链表的,所以二者的效率在不同的应用上会不太一样。