ArrayList 排序 Java

package hashsetdemo;

import java.util.Objects;

public class Student1 implements Comparable<Student1>{
    private String name;
    private int age;

    public Student1() {
    }

    public Student1(String name, int age) {
        this.name = name;
        this.age = age;
    }

    public String getName() {
        return name;
    }

    public void setName(String name) {
        this.name = name;
    }

    public int getAge() {
        return age;
    }

    public void setAge(int age) {
        this.age = age;
    }

    @Override
    public boolean equals(Object o) {
        if (this == o) return true;
        if (o == null || getClass() != o.getClass()) return false;
        Student1 student = (Student1) o;
        return age == student.age && Objects.equals(name, student.name);
    }

    @Override
    public int hashCode() {
        return Objects.hash(name, age);
    }

    @Override
    public int compareTo(Student1 o) {
        /**
         * 集合排序
         */
        // return this.age - o.getAge(); // 按照年龄排序 从小到大
        int num = o.getAge() - this.age;
        int num2 = num == 0 ? this.name.compareTo(o.name) : num;
        return num2; // 按照年龄排序 从大到小
        // return o.hashCode();
        // return 0; // 只存储一个
        // return 1; // 按照升序排序
        // return -1; // 按照降序排序
    }
}

package hashsetdemo;

import java.util.Objects;

public class Student {
    private String name;
    private int age;

    public Student() {
    }

    public Student(String name, int age) {
        this.name = name;
        this.age = age;
    }

    public String getName() {
        return name;
    }

    public void setName(String name) {
        this.name = name;
    }

    public int getAge() {
        return age;
    }

    public void setAge(int age) {
        this.age = age;
    }

    @Override
    public boolean equals(Object o) {
        if (this == o) return true;
        if (o == null || getClass() != o.getClass()) return false;
        Student student = (Student) o;
        return age == student.age && Objects.equals(name, student.name);
    }

    @Override
    public int hashCode() {
        return Objects.hash(name, age);
    }
}

package hashsetdemo.bijiaoqi;

import hashsetdemo.Student1;

import java.util.Comparator;
import java.util.TreeSet;

public class TreesetDemo {
    public static void main(String[] args) {
        TreeSet<Student> ts = new TreeSet<>(new Comparator<Student>() {
            @Override
            public int compare(Student o1, Student o2) {
                int num = o1.getAge() - o2.getAge();
                int num2 = num == 0 ? o1.getName().compareTo(o2.getName()) : num;
                return num2;
            }
        });

        Student s1 = new Student("xisi",29);
        Student s2 = new Student("wangwu",30);
        Student s3 = new Student("lisi",11);
        Student s4 = new Student("lis2i",12);
        Student s5 = new Student("lis22i",12);

        ts.add(s1);
        ts.add(s2);
        ts.add(s3);
        ts.add(s4);
        ts.add(s5);

        for (Student s:ts){
            System.out.println(s.getName()+s.getAge());
        }

    }
}