Collections.sort(List<T> list, Comparator<? super T> c)

    1. ArrayList<Integer> arrayList = new ArrayList<Integer>();
    2. arrayList.add(-1);
    3. arrayList.add(3);
    4. arrayList.add(3);
    5. arrayList.add(-5);
    6. arrayList.add(7);
    7. arrayList.add(4);
    8. arrayList.add(-9);
    9. arrayList.add(-7);
    10. System.out.println("原始数组:");
    11. System.out.println(arrayList);
    12. // void reverse(List list):反转
    13. Collections.reverse(arrayList);
    14. System.out.println("Collections.reverse(arrayList):");
    15. System.out.println(arrayList);
    16. // void sort(List list),按自然排序的升序排序
    17. Collections.sort(arrayList);
    18. System.out.println("Collections.sort(arrayList):");
    19. System.out.println(arrayList);
    20. // 定制排序的用法
    21. Collections.sort(arrayList, new Comparator<Integer>() {
    22. @Override
    23. public int compare(Integer o1, Integer o2) {
    24. return o2.compareTo(o1);
    25. }
    26. });
    27. System.out.println("定制排序后:");
    28. System.out.println(arrayList);

    Output:

    1. 原始数组:
    2. [-1, 3, 3, -5, 7, 4, -9, -7]
    3. Collections.reverse(arrayList):
    4. [-7, -9, 4, 7, -5, 3, 3, -1]
    5. Collections.sort(arrayList):
    6. [-9, -7, -5, -1, 3, 3, 4, 7]
    7. 定制排序后:
    8. [7, 4, 3, 3, -1, -5, -7, -9]