TreeSet保存的数据允许进行排序处理，那么就可以使用自定义的类来作为保存数据
|
package com.yidu.test;
import java.util.HashSet;
import java.util.Set;
import java.util.TreeSet;
class Person implements Comparable<Person>{
private int ids;
private String name;
private int age;
public Person(int ids,String name,int age){
this.ids=ids;
this.name=name;
this.age=age;
}
@Override
public String toString() {
return "Person [ids=" + ids + ", name=" + name + ", age=" + age + "]";
}
@Override
public int compareTo(Person o) {
if(this.age>o.age){
return -1;
}else if(this.age<o.age){
return 1;
}else{
return this.name.compareTo(o.name);
}
}
}
public class Love {
public static void main(String[] args) {
Set<Person> set=new TreeSet<Person>();
set.add(new Person(1, "张三", 10));//年龄相同
set.add(new Person(2, "李四", 10));
set.add(new Person(3, "王五", 25));//全相同
set.add(new Person(4, "王五", 25));
System.out.println(set);
}
}
|
只要在java中牵涉到一组对象的排序操作使用Comparable接口完成。
