Comparator 定制排序

package main.java.com;

import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;

/*
    Comparator定制排序

 */
public class Test {
    public static void main(String[] args) {
        ArrayList<Integer> arrayList = new ArrayList<>();
        arrayList.add(-1);
        arrayList.add(3);
        arrayList.add(3);
        arrayList.add(-5);
        arrayList.add(7);
        arrayList.add(4);
        arrayList.add(-9);
        arrayList.add(-7);
        System.out.println("原始数组");
        System.out.println(arrayList);

        //void reverse(List list):反转
        Collections.reverse(arrayList);
        System.out.println("Collections.reverse(arrayList）：");
        System.out.println(arrayList);

        //void sort(List list):按自然排序的升序进行排序
        Collections.sort(arrayList);
        System.out.println("Collections.sort(arrayList):");
        System.out.println(arrayList);

        //定制排序的用法
        Collections.sort(arrayList, new Comparator<Integer>() {
            @Override
            public int compare(Integer o1, Integer o2) {
                return o1.compareTo(o2);
            }
        });
        System.out.println("定制排序后:");
        System.out.println(arrayList);

    }
}

输出结果：

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