TreeSet()添加元素时,需要对元素与已经存在与红黑树中的节点进行比较。
比较规则之一,添加元素的类实现Comparable接口并实现函数进行比较
比较规则之二,在创建TreesSet的时候传入Comparator的匿名内部类,如下:
目标:TreeSet添加Student对象,并且根据Students的age属性进行排序,如果age相同则比较name,都相同则舍弃。
//Student类
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;
}
/**
* 获取
* @return age
*/
public int getAge() {
return age;
}
/**
* 设置
* @param 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);
}
public String toString() {
return "Student{name = " + name + ", age = " + age + "}";
}
}
//main测试类
Student stu1 = new Student("张三", 30);
Student stu2 = new Student("李四", 23);
Student stu3 = new Student("王五", 54);
Student stu4 = new Student("张三", 30);
Student stu5 = new Student("小明", 30);
TreeSet<Student> ts = new TreeSet<>(new Comparator<Student>() {
@Override
public int compare(Student o1, Student o2) {
int i = o1.getAge() - o2.getAge();
i = i == 0 ? o1.getName().compareTo(o2.getName()) : i;
return i;
}
});
ts.add(stu1);
ts.add(stu2);
ts.add(stu3);
ts.add(stu4);
ts.add(stu5);
System.out.println(ts);
//结果:[Student{name = 李四, age = 23},
//Student{name = 小明, age = 30},
//Student{name = 张三, age = 30},
//Student{name = 王五, age = 54}]
当然Student类是自定义类,用Comparable接口比较好。
如果是String已经实现了Comparable接口,那么不可能修改String的接口,所以用方法二比较好。