Java實現對List中的對象按某個字段進行排序

聲明
1）該文章整理自網上的大牛和專家無私奉獻的資料，具體引用的資料請看參考文獻。
2）本文僅供學術交流，非商用。如果某部分不小心侵犯了大家的利益，還望海涵，並聯系博主刪除。
3）博主才疏學淺，文中如有不當之處，請各位指出，共同進步，謝謝。
4）此屬於第一版本，若有錯誤，還需繼續修正與增刪。還望大家多多指點。大家都共享一點點，一起為祖國科研的推進添磚加瓦。

public class Logs implements Serializable, Comparable<Logs> {
 
    private String id;
    private String username;
    private String contents;
    private String consequence;
    private String ip;
    private Long times;
 
    @Override
    public int compareTo(Logs o) {
        return 0;
    }
 
}
解析: Logs實體,要繼承Comparable<T>接口, 然后再實現一個public int compareTo(Logs o) 方法.

現在,我要對List<Logs> 中的數據按 times 字段進行排序


    @Test
    public void testMath(){
        List<Logs> list = new ArrayList<Logs>();
        list.add(new Logs("1","chen", "djifand", "jdifa", "jdfid", 49L));
        list.add(new Logs("134","ce", "cae", "jdifa", "jdfid", 123L));
        list.add(new Logs("3","cet", "djifand", "jdifa", "jdfid", 99L));
        list.add(new Logs("4","egge", "djifand", "jdifa", "jdfid", 111L));
        list.add(new Logs("15","chen", "djifand", "jdifa", "jdfid", 59L));
        list.add(new Logs("6","chen2", "cae", "jdifa", "jdfid", 123L));
        list.add(new Logs("87","cet", "djifand", "jdifa", "jdfid", 213L));
        list.add(new Logs("8","egge", "djifand", "jdifa", "jdfid", 201L));
        list.add(new Logs("9","egge2", "djifand", "jdifa", "jdfid", 269L));
        list.add(new Logs("10","ce", "cae", "jdifa", "jdfid", 121L));
        list.add(new Logs("11","chen3", "djifand", "jdifa", "jdfid", 1123L));
        list.add(new Logs("5","cet2", "djifand", "jdifa", "jdfid", 12L));
 
        System.out.println("---- 排序前的輸出  ----- ");
        for (Logs logs : list) {
            System.out.println("數據: "+logs);
        }
        System.out.println("---- 排序后的結果  ----- ");
        List<Logs> search = search(list);
 
        for (Logs logs : search) {
            System.out.println("-->"+logs);
        }
 
    }
 
 
     // 方式1: 降序排列
     public List<Logs> search(List<Logs> logsList){
        Collections.sort(logsList, new Comparator<Logs>() {
            @Override
            public int compare(Logs o1, Logs o2) {
                if ((o1.getTimes() > o2.getTimes())){
                    return -1;
                }
                if (o1.getTimes() == o2.getTimes()){
                    return 0;
                }
                return 1;
            }
        });
        return logsList;
    }
 
     // 方式2: 升序排列
     public List<Logs> search(List<Logs> logsList){
        Collections.sort(logsList, new Comparator<Logs>() {
            @Override
            public int compare(Logs o1, Logs o2) {
                if ((o1.getTimes() > o2.getTimes())){
                    return 1;
                }
                if (o1.getTimes() == o2.getTimes()){
                    return 0;
                }
                return -1;
            }
        });
        return logsList;
    }
    // 方式3: 降序排列 
    public List<Logs> search(List<Logs> logsList){
        Collections.sort(logsList, new Comparator<Logs>() {
            @Override
            public int compare(Logs o1, Logs o2) {
                return -o1.getTimes().compareTo(o2.getTimes());
            }
        });
        return logsList;
    }
 
    // 方式4: 升序排列
    public List<Logs> search(List<Logs> logsList){
        Collections.sort(logsList, new Comparator<Logs>() {
            @Override
            public int compare(Logs o1, Logs o2) {
                return o1.getTimes().compareTo(o2.getTimes());
            }
        });
        return logsList;
    }