ArrayList和LinkedList性能对比测试

package com.test.api;


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


public class TestList {


<span style="white-space:pre">	</span>/**
<span style="white-space:pre">	</span> * @author Administrator
<span style="white-space:pre">	</span> * @date 2016-11-3下午11:49:12
<span style="white-space:pre">	</span> * @功能: List 有序，可重复 1.ArrayList查询很快，但增删较慢 --底层的数据结构使用的是数组结构 取代Vector
<span style="white-space:pre">	</span> *      查询还是增删都很慢 2.LinkedList 查询较慢，增删较快 --底层的数据结构是链表结构
<span style="white-space:pre">	</span> */
<span style="white-space:pre">	</span>public static void main(String[] args) {
<span style="white-space:pre">		</span>int i = 0;
<span style="white-space:pre">		</span>long t1, t2, t3, t4, t5, t6;
<span style="white-space:pre">		</span>// ArrayList
<span style="white-space:pre">		</span>List<String> list = new ArrayList<String>();
<span style="white-space:pre">		</span>t1 = System.currentTimeMillis();
<span style="white-space:pre">		</span>for (i = 0; i < 53140; i++) {
<span style="white-space:pre">			</span>list.add("a" + i);
<span style="white-space:pre">		</span>}
<span style="white-space:pre">		</span>t2 = System.currentTimeMillis();
<span style="white-space:pre">		</span>for (i = 0; i < list.size(); i++) {
<span style="white-space:pre">			</span>list.get(i);
<span style="white-space:pre">			</span>System.out.println(list.get(i));
<span style="white-space:pre">		</span>}
<span style="white-space:pre">		</span>t3 = System.currentTimeMillis();


<span style="white-space:pre">		</span>// LinkedList
<span style="white-space:pre">		</span>List<String> listlink = new LinkedList<String>();
<span style="white-space:pre">		</span>t4 = System.currentTimeMillis();
<span style="white-space:pre">		</span>for (i = 0; i < 53140; i++) {
<span style="white-space:pre">			</span>listlink.add("b" + i);
<span style="white-space:pre">		</span>}
<span style="white-space:pre">		</span>t5 = System.currentTimeMillis();
<span style="white-space:pre">		</span>for (i = 0; i < listlink.size(); i++) {
<span style="white-space:pre">			</span>listlink.get(i);
<span style="white-space:pre">			</span>System.out.println(listlink.get(i));
<span style="white-space:pre">		</span>}
<span style="white-space:pre">		</span>t6 = System.currentTimeMillis();
<span style="white-space:pre">		</span>System.out.println("Run Time ArrayList:add " + (t2 - t1) + "(ms)");
<span style="white-space:pre">		</span>System.out.println("Run Time ArrayList:query " + (t3 - t2) + "(ms)");
<span style="white-space:pre">		</span>System.out.println("Run Time LinkedList: add " + (t5 - t4) + "(ms)");
<span style="white-space:pre">		</span>System.out.println("Run Time LinkedList: query " + (t6 - t5) + "(ms)");
<span style="white-space:pre">	</span>}


}

*运行结果：

Run Time ArrayList:add 38(ms)
Run Time ArrayList:query 303(ms)
Run Time LinkedList: add 12(ms)
Run Time LinkedList: query 11075(ms)

很显然，在常规情况下ArrayList  比LinkedList好用。

LinkedList的查询太慢了，而ArrayList增加却不会比LinkedList差太离谱。