Java集合框架讲解.pptVIP

Java集合框架;Set和List是Collection接口的子接口;;Collection接口;Iterator 接口;Set接口;1 散列集HashSet;import java.util.*; public class TestHashSet { public static void main(String[] args) { Set String set =new HashSetString(); set.add(London); set.add(Paris); set.add(New York); set.add(San Francisco); set.add(Beijing); set.add(New York); System.out.println(set); Iterator iterator =set.iterator(); while (iterator.hasNext()) { System.out.println(iterator.next()+); } } };2 链式散列集LinkedHashSet;public class TestLinkedHashSet { public static void main(String[] args) { Set String set =new LinkedHashSetString(); set.add(London); set.add(Paris); set.add(New York); set.add(San Francisco); set.add(Beijing); set.add(New York); System.out.println(set); for (Object element: set) { System.out.println(element.toString()+); } } };3 树形集TreeSet;public class TestTreeSet { public static void main(String[] args) { Set String set =new HashSetString(); set.add(London); set.add(Paris); set.add(New York); set.add(San Francisco); set.add(Beijing); set.add(New York); System.out.println(HashSet:); System.out.println(set); TreeSetString treeSet=new TreeSetString(set); System.out.println(TreeSet:); System.out.println(treeSet); SortedSet head_set=treeSet.headSet(New York); System.out.println(headSet(New York):); for (Object element: head_set) { System.out.println(element.toString()+); } } };4 线性表List;线性表List的方法和迭代器;List的具体子类ArrayList和LinkedList;LinkedList提供从线性表两端添加和删除元素的方法;public class TestArrayAndLinkedList { public static void main(String[] args) { List Integer arrayList=new ArrayListInteger(); arrayList.add(1); arrayList.add(2); arrayList.add(3); arrayList.add(1); arrayList.add(4); arrayList.add(0,10); arrayList.add(3,30); System.out.println(整数类型的ArrayList的线性表是：); System.out.println(arrayList); ;LinkedList Object linkedList=new LinkedList Object(arrayList