Question

Is there a quicker, more efficient means of doing so than using a ListIterator?

ListIterator<Integer> itr = list.listIterator(list.size());
while(itr.hasPrevious()){
    System.out.println(itr.previous());
}

Answer 1

Depending on the implementation of the List and ListIterator the following may be (slightly) quicker.

List l;
for (int i = l.size()-1; i >=0; i--) {
    System.out.println(l.get(i));
}

This may be faster for an ArrayList but it will almost certainly be slower for a LinkedList.

Your best bet is to just use the iterator.

It is almost certain that whatever work you are doing in the loop will negate any performance gained by not using the iterator.