java自定义排序_java 两种方式实现自定义排序

package test;//Comparable 使工具自己具有可比性，那类格式称为元素的自然按序或默许按序//Comparator 元素自己没有具有比较性或比较性没有是所需供的，正在纠散初初化让其具有比较性 (更开用)import java.util.*;//class public class TreeSetDemo {public static void main(String[] args) {TreeSet st=new TreeSet(new MyComparator());st.add(new Student("bca",23));st.add(new Student("bca",23));st.add(new Student("abc",29));st.add(new Student("dcba",24));for(Iterator it=st.iterator();it.hasNext();){Student p=it.next();System.out.println(p.getName()+"==="+p.getAge());}}}class Student implements Comparable //真现了接心必须真现compare()；{private String name;private int age;Student(String name,int age){this.name=name;this.age=age;} String getName(){return name;}int getAge(){return age;}@Overridepublic int compareTo(Student st)//真现compare格式 {if(this.age>st.age)return 1;if(this.age==st.age)return 0;return -1;}}//Object类真现了equail();所以真现接心以下时只需对compare()重写便可class MyComparator implements Comparator//真现了接心必须真现compare()；{@Overridepublic int compare(Student s1,Student s2) {int num=s1.getName().compareTo(s2.getName());if(num==0){return new Integer(s1.getAge()).compareTo(new Integer(s2.getAge()));//Integer 类真现了Comparable接心//if(s1.getAge()>s2.getAge())//return 1;//if(s1.getAge()==s2.getAge())//return 0;//return -1;}return num;}}