比较器排序:
public class CompareDemo {
public static void main(String[] args) {
TreeSet ts = new TreeSet(
//这里用匿名内部类:内部类的格式是new 一个类或者接口然后重写方法就好了!
new Comparator() {
public int compare(Student o1, Student o2) {
int num = o1.getAge() - o2.getAge();
if(num == 0)
{
o1.getName().compareTo(o2.getName());
}
return num;
};
}
);
Student s1 = new Student("one",1);
Student s2 = new Student("two",2);
Student s3 = new Student("three",3);
Student s4 = new Student("four",4);
Student s5 = new Student("five",5);
Student s6 = new Student("six",6);
Student s7 = new Student("six",6);
Student s8 = new Student("four",4);
ts.add(s1);
ts.add(s2);
ts.add(s3);
ts.add(s4);
ts.add(s5);
ts.add(s6);
ts.add(s7);
ts.add(s8);
for(Student s :ts)
{
System.out.println(s.getAge() + s.getName());
}
}
}