运行结果://iterator迭代器 public class SimpleIteration { public static void main(String[] args) { Collection<Integer> pets = new ArrayList(10); for (int i = 0; i < 10; i++) pets.add(i); Iterator<Integer> it = pets.iterator(); while (it.hasNext()) { Integer a = it.next(); System.out.print(a.intValue() + " "); } System.out.println(); it = pets.iterator(); for (int i = 0; i < 6; i++) { it.next(); it.remove(); } System.out.print(pets + " "); } }
0 1 2 3 4 5 6 7 8 9 [6, 7, 8, 9]
运行结果://List的特点 public class LinkedListFeatures { public static void main(String[] args) { LinkedList<Integer> pets = new LinkedList<Integer>(); for (int i = 0; i < 10; i++) pets.add(i); System.out.println(pets); System.out.println("pets.getFirst():" + pets.getFirst()); // 无返回值则抛出异常 System.out.println("pets.element():" + pets.element()); System.out.println("pets.peek():" + pets.peek()); // 无返回值则返回null System.out.println(pets); System.out.println("pets.remove():" + pets.remove()); System.out.println("pets.removeFirst():" + pets.removeFirst()); System.out.println("pets.poll():" + pets.poll()); // 无返回值则返回null System.out.println(pets); pets.addFirst(9); System.out.println("after addFirst(9):" + pets); pets.offer(34); System.out.println("after offer(34):" + pets); pets.add(67); System.out.println("after add(67):" + pets); pets.addLast(98); System.out.println("after addLast(98):" + pets); System.out.println("pets.removeLast():" + pets.removeLast()); } }
[0, 1, 2, 3, 4, 5, 6, 7, 8, 9] pets.getFirst():0 pets.element():0 pets.peek():0 [0, 1, 2, 3, 4, 5, 6, 7, 8, 9] pets.remove():0 pets.removeFirst():1 pets.poll():2 [3, 4, 5, 6, 7, 8, 9] after addFirst(9):[9, 3, 4, 5, 6, 7, 8, 9] after offer(34):[9, 3, 4, 5, 6, 7, 8, 9, 34] after add(67):[9, 3, 4, 5, 6, 7, 8, 9, 34, 67] after addLast(98):[9, 3, 4, 5, 6, 7, 8, 9, 34, 67, 98] pets.removeLast():98