List 排序

package cn.dingyuegroup.dayu.management.service.util;

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

public class Students {
      
    private int age;  
    private int score;  
      
    public Students(int age, int score){  
        super();  
        this.age = age;  
        this.score = score;  
    }  
      
    public int getAge() {  
        return age;  
    }  
    public void setAge(int age) {  
        this.age = age;  
    }  
    public int getScore() {  
        return score;  
    }  
    public void setScore(int score) {  
        this.score = score;  
    }


    public static void main(String[] args) {
        List<Students> students = new ArrayList<Students>();
        students.add(new Students(23, 100));
        students.add(new Students(27, 98));
        students.add(new Students(29, 99));
        students.add(new Students(29, 98));
        students.add(new Students(22, 89));
        // 第一种排序方式
        students.sort(Comparator.comparingInt(Students::getAge));
        // 第二种自定义排序
        Collections.sort(students, new Comparator<Students>() {
            @Override
            public int compare(Students o1, Students o2) {
                // o2-o1  降序  o1-o2 升序
                int i =  o2.getScore() - o1.getScore(); 
                //  等于的情况在按年龄排序
                if(i == 0){
                    return o1.getAge() - o2.getAge();
                }
                return i;
            }
        });
        for(Students stu : students){
            System.out.println("score:" + stu.getScore() + ":age" + stu.getAge());
        }
    }

}