第二:List和ArrayList和LinkedList和TreeSet和HashSet之间使用效率问题:
常见操作:1:添加/遍历
int mis = 100000;
List<String> List = new ArrayList<>();
ArrayList<String> arrayList = new ArrayList<>();
LinkedList<String> linkedList = new LinkedList<>();
long m1 = System.currentTimeMillis();
for (int i = 0; i < mis; i++) {
List.add("12asasd"+i);
}
long m2 = System.currentTimeMillis();
long list = m2-m1;
System.out.println("list添加用时:"+list);
for (int i = 0; i < mis; i++) {
arrayList.add("12asasd");
}
long m3 = System.currentTimeMillis();
long Arraylist = m3-m2;
System.out.println("Arraylist添加用时:"+Arraylist);
for (int i = 0; i < mis; i++) {
linkedList.add("12asasd");
}
long m4 = System.currentTimeMillis();
long linkedListm = m4-m3;
System.out.println("linkedList添加用时:"+linkedListm);
StringBuffer buffer = new StringBuffer();
long l = System.currentTimeMillis();
for (String lists : List) {
buffer.append(lists);
}
long ll = System.currentTimeMillis();
long listb = ll-l;
System.out.println("list遍历用时:"+listb);
for (String lists : arrayList) {
buffer.append(lists);
}
long lll = System.currentTimeMillis();
long array = lll-ll;
System.out.println("arraylist遍历用时:"+array);
for (String lists : linkedList) {
buffer.append(lists);
}
long llll = System.currentTimeMillis();
long linked = llll-lll;
System.out.println("linkedList遍历用时:"+linked);
打印结果:
list添加用时:41
Arraylist添加用时:6
linkedList添加用时:4
list遍历用时:14
arraylist遍历用时:8
linkedList遍历用时:23
由此我们得出linkedList添加快Arraylist遍历快,注意点我们通长查询数据时会返回集合展示前台页面,我们多用ArrayList,不要强转为List