Java--通过接口进行排序

描述： 对学生排序，先按成绩由大到小排序，成绩相同按姓名字母排序，姓名相同再按学号由小到大排序。

  package src7;
    import java.util.*;
    class Student implements Comparable<Student>  {
        private String name;
        private int id;
        private int grade;

    public Student(String name, int id, int grade) {
        this.name = name;
        this.id = id;
        this.grade = grade;
    }
    public int compareTo(Student o) {
            Student s = (Student) o;
            if (this.grade>s.grade) {
                return -1;//返回负数,当前成绩排前
            } else if (this.grade == s.grade) {
//                if (this.name.hashCode() < s.name.hashCode()) {
//                    return -1;          //使用hashCode()
                if (this.name.compareTo(s.name)<0) {
                    return -1;            //使用compareTo
//                } else if (this.name.hashCode() == s.name.hashCode()) {
                } else if (this.name.compareTo(s.name)==0) {
                    if (this.id < s.id) {
                        return -1;
                    } else if (this.id == s.id) {
                        return 0;//此处说明姓名学号成绩全部相同
                    } else {
                        return 1;
                    }
                } else {
                    return 1;// 返回正数，当前对象排后
                }
            } else {
                return 1;
            }
        }

    @Override
    public String toString() {
        return "姓名：" + this.name +",学号："+this.id+ ",成绩：" + this.grade + "\n";
    }
}
public class Test {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        Student[] arr = new Student[3];
        for (int i = 0; i < arr.length; i++) {
            System.out.println("输入第" + (i + 1) + "个学生的姓名、学号和成绩：");
            String name = in.next();
            int id = in.nextInt();
            int grade = in.nextInt();
            arr[i] = new Student(name, id, grade);
        }
        System.out.println("排序前：");
        for(int i = 0; i < arr.length; i++){
            System.out.println(arr[i]);
        }
        System.out.println("排序后：");{
        List<Student>students=Arrays.asList(arr);
        Collections.sort(students);
        System.out.println(students);
        //也可以使用冒泡排序
        for(int i=0;i<arr.length;i++) {
            System.out.println(arr[i]);
        }
        }   
        }
    }

知识点：
1.Comparable接口
包含的比较方法：
public interface Comparable< T >{
public int compareTo(T obj);
}
比较当前对象与外来对象，让当前对象排前就返回负值，反之返回正值，相等返回0

关于Comparable接口的简单举例：对人的姓和名进行排序

package src7;
import java.util.*;
class Person implements Comparable<Person>{
    private final String lastname,firstname;//lastname表示姓 firstname表示名
    public Person(String lastname,String firstname){
        this.lastname=lastname;
        this.firstname=firstname;
    }
    public String lastname(){
        return lastname;
    }
    public String firstname(){
        return firstname;
    }
    public boolean equals(Object obj){
        Person n=(Person)obj;
        return (n.lastname.equals(lastname)&&n.firstname.equals(firstname));
    }
    public int hashCode(){
        return lastname.hashCode()+firstname.hashCode();
    }
    public String toString(){
        return lastname+" "+firstname;
    }
    public  int compareTo(Person n){
        if(lastname.compareTo(n.lastname)<0)
            return -1;
       if(lastname.compareTo(n.lastname)>0)
           return 1;
       else {
           if(firstname.compareTo(n.firstname)<0)
               return -1;
           if(firstname.compareTo(n.firstname)>0)
               return 1;
           else return 0;
       }
    }
}
public class Test {
    public static void main(String[]args){
        Person personArr[]={
                new Person("Zhang","Liang"),
                new Person("Li","Si"),
                new Person("Wang","Ning"),
                new Person("Zhang","San"),
                new Person("Chen","Yi")
        };
        List<Person>persons=Arrays.asList(personArr);
        Collections.sort(persons);
        System.out.println(persons);
    }
}

运行结果：

2.Comparator接口
包含的比较方法：
public interface Comparator< T >{
public int compare(T obj1,T obj2);
}
比较对象obj1和obj2，让obj1位于obj2之前则返回负值
简单举例：对姓名排序

package src7;
import sun.awt.geom.AreaOp;
import java.util.*;
class Person{
    private String name;
    public Person(String name){
        this.name=name;
    }
    public String getName(){
        return name;
    }
    public String toString(){
        return name;
    }
}
 public class Test{
    static final Comparator<Person> ODER_BY_NAME=new Comparator<Person>() {
        @Override
        public int compare(Person o1, Person o2) {
            return o1.getName().compareTo(o2.getName());
        }
    };
     public static void main(String[] args) {
         Person personArr[]={
                new Person("ZhangLiang"),
                new Person("LiSi"),
                new Person("WangNing"),
                 new Person("ZhangSan"),
                new Person("ChenYi")
        };
         List<Person>persons=Arrays.asList(personArr);
        Collections.sort(persons,ODER_BY_NAME);
        System.out.println(persons);
         }
     }

运行结果：