Collection 接口、Collections类和Comparable接口、Comparator接口上机试验.docVIP

例题1 import java.util.List; import java.util.Arrays; import java.util.Collections; public class Sort1 { private static final String suits[] = { Hearts, Diamonds, Clubs,Spades }; // 显示数组元素 public void printElements() { ListString list = Arrays.asList(suits); // 生成列表 // 输出列表 System.out.printf(Unsorted array elements:\n%s\n, list); Collections.sort(list); // 输出列表 System.out.printf(Sorted array elements:\n%s\n, list); } public static void main(String args[]) { ort1 sort1 = new Sort1(); sort1.printElements(); } // end main } // end class Sort1 例题1改进: import java.util.List; import java.util.Arrays; import java.util.Collections; public class Sort1 { private static final String suits[] = { Hearts, Diamonds, Clubs,Spades }; // output List elements public void printElements() { ListString list = Arrays.asList(suits); // create List // output List elements System.out.printf(Unsorted array elements:\n%s\n, list); // sort in descending order（降序） using a comparator Collections.sort(list, Collections.reverseOrder()); // output List elements System.out.printf(Sorted list elements:\n%s\n, list); } // end method printElements public static void main(String args[]) { Sort1 sort1 = new Sort1(); sort1.printElements(); } // end main } 例题2(PPT上例题) import java.util.*; class AlgorithmExample1 { public static void main(String args[]) { ListInteger link = new ArrayListInteger(); link.add(new Integer(10)); link.add(new Integer(35)); link.add(new Integer(23)); link.add(new Integer(54)); link.add(new Integer(36)); ComparatorInteger cmp = Collections.reverseOrder(); Collections.sort(link, cmp); IteratorInteger it = link.iterator(); System.out.println(逆序排序的列表为： ); while (it.hasNext()) { System.out.println(it.next()); } System.out.println(给定列表中的最大值为： + Collections.max(link)); System.out.println(给定列表中的最小值为： + Collections.min(link)); } } 例题3 import java.util.Arrays; import java.util.Comparator; /** * 用 Arrays.sort() 排序。 * 演示了如