在AbstractSequentialList中已经定义了很多的处理方法,只要LinkedList实现
-
public abstract ListIterator<E> listIterator(int index);
ArrayList是实现了基于动态数组的数据结构,而LinkedList是基于链表的数据结构
对于随机访问get和set,ArrayList要优于LinkedList,因为LinkedList要移动指针;
对于添加和删除操作add和remove,一般大家都会说LinkedList要比ArrayList快,因为ArrayList要移动数据。但是实际情况并非这样,对于添加或删除,LinkedList和ArrayList**并不能明确说明谁快谁慢**,因为ArrayList会复制后继元素,而LinkedList会移动index指针。
在列表头上插入,肯定LinkedList快。。。其他情况下,ArrayList的get效率和insert效率都比LinkedList要高得多
public class ListTest {
static List<Integer> array=new ArrayList<Integer>();
static List<Integer> linked=new LinkedList<Integer>();
public static void main(String[] args) {
for(int i=0;i<10000;i++){
array.add(i);
linked.add(i);
}
System.out.println("array time:"+getTime(array));
System.out.println("linked time:"+getTime(linked));
System.out.println("array insert time:"+insertTime(array));
System.out.println("linked insert time:"+insertTime(linked));
}
public static long getTime(List<Integer> list){
long time=System.currentTimeMillis();
for(int i = 0; i < 10000; i++){
int index = Collections.binarySearch(list, list.get(i));
if(index != i){
System.out.println("ERROR!");
}
}
return System.currentTimeMillis()-time;
}
public static long insertTime(List<Integer> list){
long num = 10000;
int index = 9000;
long time=System.currentTimeMillis();
for(int i = 1; i < num; i++){
list.add(index, i);
}
return System.currentTimeMillis()-time;
}
}
在index=10出插入结果:
array time:22
linked time:787
array insert time:54
linked insert time:3
在index=1000处插入结果:
array time:1
linked time:595
array insert time:41
linked insert time:44
在index=5000处插入结果:
array time:12
linked time:537
array insert time:30
linked insert time:197
在index=9000处插入结果:
array time:11
linked time:634
array insert time:15
linked insert time:225
部分源码分析
LinkedList
public E get(int index) {
checkElementIndex(index);
return node(index).item;
}
public E set(int index, E element) {
checkElementIndex(index);
Node<E> x = node(index);
E oldVal = x.item;
x.item = element;
return oldVal;
}
public void add(int index, E element) {
checkPositionIndex(index);
if (index == size)
linkLast(element);
else
linkBefore(element, node(index));
}
public E remove(int index) {
checkElementIndex(index);
return unlink(node(index));
}
Node<E> node(int index) {
if (index < (size >> 1)) {
Node<E> x = first;
for (int i = 0; i < index; i++)
x = x.next;
return x;
} else {
Node<E> x = last;
for (int i = size - 1; i > index; i--)
x = x.prev;
return x;
}
}
ArrayList
public E get(int index) {
rangeCheck(index);
return elementData(index);
}
public E set(int index, E element) {
rangeCheck(index);
E oldValue = elementData(index);
elementData[index] = element;
return oldValue;
}
public void add(int index, E element) {
rangeCheckForAdd(index);
ensureCapacityInternal(size + 1);
System.arraycopy(elementData, index, elementData, index + 1,
size - index);
elementData[index] = element;
size++;
}
public E remove(int index) {
rangeCheck(index);
modCount++;
E oldValue = elementData(index);
int numMoved = size - index - 1;
if (numMoved > 0)
System.arraycopy(elementData, index+1, elementData, index,
numMoved);
elementData[--size] = null;
return oldValue;
}