自然排序Comparable

自然排序Comparable

案例需求
存储学生对象并遍历，创建TreeSet集合使用无参构造方法
要求：

按照年龄从小到大排序，年龄相同时，按照姓名的字母顺序排序

//Student
package com.ningxiao.day19;
import java.util.Objects;
public class Student implements Comparable<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);
    }
    
    @Override
    public int compareTo(Student student) {
        int a = this.getAge() - student.getAge();
        if (a==0){
            return this.getName().compareTo(student.getName());
            //String类型的compareTo()方法
        }
        return a;
    }


    @Override
    public String toString() {
        return "Student{" +
                "name='" + name + '\'' +
                ", age=" + age +
                '}';
    }
}


//Demo
package com.ningxiao.day19;
import java.util.TreeMap;
import java.util.TreeSet;
public class Demo07 {
    public static void main(String[] args) {
        
        TreeSet<Student> tree = new TreeSet<>();
        Student st1 = new Student("小明",10);
        Student st2 = new Student("小刚",12);
        Student st3 = new Student("小花",13);
        Student st4 = new Student("小红",14);
        Student st5 = new Student("小强",14);
        Student st6 = new Student("小李",16);

        tree.add(st1);
        tree.add(st2);
        tree.add(st3);
        tree.add(st4);
        tree.add(st5);
        tree.add(st6);

        for (Student st :tree){
            System.out.println(st);
        }
    }
}

注意：

​ 在自定义的类型中重写compareTo方法，需要实现Comparable接口，并且在确定实现关系的时候传递自定义类型：implements Comparable

​ 至于想如何比较，我们需要根据自己的需要进行比较，这里我们在年龄一样的情况下对姓名进行比较，在比较姓名的时候用到的是字符串类型的compareTo方法。