TreeSet定制排序

import java.util.*;
class Student implements Comparable{
    private String name;
    private int age;
    Student(String name,int age){
        this.name=name;
        this.age=age;
    }
    public int comparaTo(Object o){
        Student s=(Student)o;
        if(this.age!=s.age){
            return this.age-s.age;
        }else{
            return this.name.compareTo(s.name);
        }
    }
    public String toString (){
        return "Student's name is:"+name+"age is:"+age;
    }

    @Override
    public int compareTo(Object o) {
        return 0;
    }
}
public class TreeSetDemo {
    public static void main(String[] args) {
        TreeSet tree = new TreeSet();
        tree.add(new Student("zhang san,", 55));
        tree.add(new Student("li si", 56));
        tree.add(new Student("wang wu", 57));
        System.out.println(tree);
    }
}