1.概述
List集合代表一个元素有序、可重复的集合,集合中每个元素都有其对应的顺序索引。
ArrayList, LinkedList, Vector, Stack是List的4个实现类。
ArrayList 是一个数组队列,相当于动态数组。它由数组实现,随机访问效率高,随机插入、随机删除效率低。
LinkedList 是一个双向链表。它也可以被当作堆栈、队列或双端队列进行操作。LinkedList随机访问效率低,但随机插入、随机删除效率低。
Vector 是矢量队列,和ArrayList一样,它也是一个动态数组,由数组实现。但是ArrayList是非线程安全的,而Vector是线程安全的。
Stack 是栈,它继承于Vector。它的特性是:先进后出(FILO, First In Last Out)。
2.List 的使用场景
如果涉及到“栈”、“队列”、“链表”等操作,应该考虑用List,具体的选择哪个List,根据下面的标准来取舍。
(01) 对于需要快速插入,删除元素,应该使用LinkedList。
(02) 对于需要快速随机访问元素,应该使用ArrayList。
(03) 对于“单线程环境” 或者 “多线程环境,但List仅仅只会被单个线程操作”,此时应该使用非同步的类(如ArrayList)。
对于“多线程环境,且List可能同时被多个线程操作”,此时,应该使用同步的类(如Vector)
示例
public class ListCompareTest {
private static final int COUNT = 10000;
private static ArrayList arrayList = new ArrayList();
private static LinkedList linkedList = new LinkedList();
private static Vector vector = new Vector();
private static Stack stack = new Stack();
public static void main(String[] args) {
// 换行符
System.out.println();
// 插入
insertByPosition(stack);
insertByPosition(vector);
insertByPosition(linkedList);
insertByPosition(arrayList);
// 换行符
System.out.println();
// 随机读取
readByPosition(stack);
readByPosition(vector);
readByPosition(linkedList);
readByPosition(arrayList);
// 换行符
System.out.println();
// 删除
deleteByPosition(stack);
deleteByPosition(vector);
deleteByPosition(linkedList);
deleteByPosition(arrayList);
}
//获取list 名称
private static String getListName(List list) {
if (list instanceof LinkedList) {
return "LinkedList";
} else if (list instanceof ArrayList) {
return "ArrayList";
} else if (list instanceof Stack) {
return "Stack";
} else if (list instanceof Vector) {
return "Vector";
} else {
return "List";
}
}
//向list的指定位置插入COUNT个元素,并统计时间
private static void insertByPosition(List list) {
long startTime = System.currentTimeMillis();
// 向list的位置0插入COUNT个数
for (int i = 0; i < COUNT; i++)
list.add(0, i);
long endTime = System.currentTimeMillis();
long interval = endTime - startTime;
System.out.println(getListName(list) + " : insert " + COUNT + " elements into the 1st position use time:" + interval + " ms");
}
// 从list的指定位置删除COUNT个元素,并统计时间
private static void deleteByPosition(List list) {
long startTime = System.currentTimeMillis();
// 删除list第一个位置元素
for (int i = 0; i < COUNT; i++)
list.remove(0);
long endTime = System.currentTimeMillis();
long interval = endTime - startTime;
System.out.println(getListName(list) + " : delete " + COUNT + " elements from the 1st position use time:" + interval + " ms");
}
// 根据position,不断从list中读取元素,并统计时间
private static void readByPosition(List list) {
long startTime = System.currentTimeMillis();
// 读取list元素
for (int i = 0; i < COUNT; i++)
list.get(i);
long endTime = System.currentTimeMillis();
long interval = endTime - startTime;
System.out.println(getListName(list) + " : read " + COUNT + " elements by position use time:" + interval + " ms");
}
}
Stack : insert 10000 elements into the 1st position use time:7 ms
Vector : insert 10000 elements into the 1st position use time:8 ms
LinkedList : insert 10000 elements into the 1st position use time:2 ms
ArrayList : insert 10000 elements into the 1st position use time:8 ms
Stack : read 10000 elements by position use time:1 ms
Vector : read 10000 elements by position use time:1 ms
LinkedList : read 10000 elements by position use time:58 ms
ArrayList : read 10000 elements by position use time:1 ms
Stack : delete 10000 elements from the 1st position use time:9 ms
Vector : delete 10000 elements from the 1st position use time:5 ms
LinkedList : delete 10000 elements from the 1st position use time:1 ms
ArrayList : delete 10000 elements from the 1st position use time:7 ms