和自然排序不同,使用后早期时不用让学生类实现comparable接口,故也不用重写comparaTo方法。只需在创建TreeSet集合时新建构造器,并重写构造器的compare方法即可。
import java.util.*;
public class Main {
public static void main(String[] args) {
//创建集合,并重写compara方法
TreeSet<Student> treeSet = new TreeSet<Student>(new Comparator<Student>(){
@Override
public int compare(Student o1, Student o2) {
int num = o1.getId()-o2.getId();
int num2 = num==0?o1.getName().compareTo(o2.getName()):num;
return num2;
}
});
Student s1 = new Student(2, "张三", "男", "西安");
Student s2 = new Student(1, "李四", "女", "咸阳");
Student s3 = new Student(3, "王五", "男", "西安");
Student s4 = new Student(4, "刘双", "女", "安康");
Student s5 = new Student(4, "刘双", "女", "安康");
//添加学生对象到集合中
treeSet.add(s1);
treeSet.add(s2);
treeSet.add(s3);
treeSet.add(s4);
treeSet.add(s5);
//遍历集合
for (Student s : treeSet) {
System.out.println(s.toString());
}
}
}