| ListApplication.java - En mere tilfredsstillende form for gennemløb af en kædet liste med en iterator. | Lecture 5 - slide 24 : 28 Program 2 |
public static void main(String[] args){
LinkedList lst = new LinkedList();
Integer element;
lst.insertFirst(new Integer(1));
lst.insertFirst(new Integer(2));
lst.insertFirst(new Integer(3));
lst.deleteFirst();
lst.insertFirst(new Integer(4));
java.util.Enumeration iterator = lst.elements();
while (iterator.hasMoreElements()){
element = (Integer)iterator.nextElement();
System.out.println(element);
}
System.out.println("Listen har nu " + lst.length() + " elementer");
} //main |