TreeSet顶置排序（年龄）

package week5;

import java.util.Comparator;
import java.util.Iterator;
import java.util.TreeSet;

public class treesetTest3{
    public static void main(String[] args) {
        TreeSet<studentss> str= new TreeSet<studentss>(new xiougai());

        studentss s1=new studentss("高子健",202103550220L,24);
        studentss s2=new studentss("Vicent",202103550221L,22);
        studentss s3=new studentss("Jaychou",202103550222L,23);

        str.add(s1);
        str.add(s2);
        str.add(s3);

        for (studentss s:str){
            System.out.println(s.name+","+s.number+","+s.age);
        }
    }
}
class studentss implements Comparable {
    long number;
    String name;
    int age;

    public studentss(String name,long number,int age){
        this.name=name;
        this.number=number;
        this.age=age;
    }

    public long getNumber() {
        return number;
    }

    public void setNumber(long number) {
        this.number = number;
    }

    public String getName() {
        return name;
    }

    public void setName(String name) {
        this.name = name;
    }

    public int getAge() {
        return age;
    }

    public void setAge(int age) {
        this.age = age;
    }


    @Override
    public int compareTo(Object o) {
        return 1;
    }
}
class xiougai implements Comparator<studentss>{

    @Override
    public int compare(studentss o1, studentss o2) {
        int num=0;
        if (o1.age-o2.age<0){
            num=-1;
        }else if (o1.age-o2.age>=0){
            num=1;
        }
        return num;
    }
}