Lists

All indexing in all methods is zero-based, just like an array

ListIterator

List<String> names = new LinkedList<String>();
names.add("Yoda");
ListIterator<String> iter = names.listIterator();
System.out.println(iter.next());     // prints "Yoda"
System.out.println(iter.previous()); // prints "Yoda" 

iter.add("Anakin");
System.out.println(iter.previous()); // prints "Anakin"
System.out.println(iter.next());     // prints "Anakin"
System.out.println(iter.next());     // prints "Yoda"

iter.set("Obi-wan");
System.out.println(iter.previous()); // prints "Obi-wan"

iter.remove();
System.out.println(iter.previous()); // prints "Anakin"

add(Object o) appends to the end of the List
add(int index, Object o) inserts the element at index and moves everything else after index up one index
Object set(int index, Object o) replaces the element at index and returns what was previously there
Object remove(int index) returns and removes the element at index, moving everything else after index down one index
Object get(int index) returns the object at index
ArrayList
- The set() and get() methods are constant time
- Adding to the end of the list is amortized constant time, because occasionally the array must be resized
- The other operations are linear time, including insertion from the ListIterator
LinkedList
- Adding to the end or front is constant time, as are adds, sets, and removals using the ListIterator
- Everything else is linear time, although indices near the start and end do not experience as much of a performance hit

(next)