目录
- class Student {
- public String name;
- public int age;
- public int score;
-
- public Student(String name, int age, int score) {
- this.name = name;
- this.age = age;
- this.score = score;
- }
-
- @Override
- public String toString() {
- return "Student{" +
- "name='" + name + '\'' +
- ", age=" + age +
- ", score=" + score +
- '}';
- }
- }
- public class Test {
- public static void main(String[] args) {
- Student[] students = new Student[3];
- students[0] = new Student("b",19,60);
- students[1] = new Student("c",17,90);
- students[2] = new Student("a",18,80);
-
- //Arrays.sort(students);错误
- }
- }
按照我们之前的理解, 数组我们有一个现成的 sort 方法, 能否直接使用这个方法呢?
答案是不能的,因为和普通的整数不一样, 两个整数是可以直接比较的, 大小关系明确. 而两个学生对象的大小关系怎么确定? 这需要我们额外指定。
让我们的 Student 类实现 Comparable 接口, 并实现其中的 compareTo 方法:
- class Student implements Comparable
{ - public String name;
- public int age;
- public int score;
-
- public Student(String name, int age, int score) {
- this.name = name;
- this.age = age;
- this.score = score;
- }
-
- @Override
- public String toString() {
- return "Student{" +
- "name='" + name + '\'' +
- ", age=" + age +
- ", score=" + score +
- '}';
- }
-
- @Override
- public int compareTo(Student o) {
- //写比较规则
- if (this.age > o.age) {
- return 1;
- }else if (this.age < o.age){
- return -1;
- }else {
- return 0;
- }
- }
- }
- public class Test {
- public static void main(String[] args) {
- Student[] students = new Student[3];
- students[0] = new Student("b",19,60);
- students[1] = new Student("c",17,90);
- students[2] = new Student("a",18,80);
-
- students[0].compareTo(students[1]);
- //规则:0下标比1下标大,返回正数,0下标比1小,返回负数,0下标和1下标相等,返回0
- Arrays.sort(students);
- System.out.println(Arrays.toString(students));
- }
- }
在 sort 方法中会自动调用 compareTo 方法。compareTo 的参数是 Object , 其实传入的就是 Student 类型的对象。然后比较当前对象和参数对象的大小关系(按年龄来算)。如果当前对象应排在参数对象之前, 返回小于 0 的数字; 如果当前对象应排在参数对象之后, 返回大于 0 的数字; 如果当前对象和参数对象不分先后, 返回 0; 再次执行程序, 结果就符合预期了。

注意事项: 对于 sort 方法来说, 需要传入的数组的每个对象都是 "可比较" 的, 需要具备 compareTo 这样的能力. 通 过重写 compareTo 方法的方式, 就可以定义比较规则。

- class Student implements Comparable
{ - public String name;
- public int age;
- public int score;
-
- public Student(String name, int age, int score) {
- this.name = name;
- this.age = age;
- this.score = score;
- }
-
- @Override
- public String toString() {
- return "Student{" +
- "name='" + name + '\'' +
- ", age=" + age +
- ", score=" + score +
- '}';
- }
-
- /*@Override
- public int compareTo(Student o) {
- //写比较规则:按年龄比较
- if (this.age > o.age) {
- return 1;
- }else if (this.age < o.age){
- return -1;
- }else {
- return 0;
- }
- }*/
- @Override
- public int compareTo(Student o) {
- //写比较规则:按名字比较
- //调用name的compareTo()(即String类型的compareTo())
- if (this.name.compareTo(o.name) > 0) {
- return 1;
- }else if (this.name.compareTo(o.name) < 0){
- return -1;
- }else {
- return 0;
- }
- }
-
- }
- public class Test {
- public static void main(String[] args) {
- Student[] students = new Student[3];
- students[0] = new Student("b",19,60);
- students[1] = new Student("c",17,90);
- students[2] = new Student("a",18,80);
-
- students[0].compareTo(students[1]);
- //规则:0下标比1下标大,返回正数,0下标比1小,返回负数,0下标和1下标相等,返回0
- Arrays.sort(students);
- System.out.println(Arrays.toString(students));
- }
- }
运行结果是:

为了进一步加深对接口的理解, 我们可以尝试自己实现一个 sort 方法来完成刚才的排序过程(使用冒泡排序)
- public class Test {
- public static void sort(Comparable[] array) {
- for (int i = 0; i < array.length - 1; i++) {
- for (int j = 0; j < array.length-1-i; j++) {
- //交换
- if (array[j].compareTo(array[j+1]) > 0) {
- Comparable tmp = array[j];
- array[j] = array[j+1];
- array[j+1] = tmp;
- }
- }
- }
- }
-
- public static void main(String[] args) {
- Student[] students = new Student[3];
- students[0] = new Student("b",19,60);
- students[1] = new Student("c",17,90);
- students[2] = new Student("a",18,80);
-
- sort(students);//调用自己写的sort方法
- System.out.println(Arrays.toString(students));
-
- students[0].compareTo(students[1]);
- //规则:0下标比1下标大,返回正数,0下标比1小,返回负数,0下标和1下标相等,返回0
- Arrays.sort(students);
- System.out.println(Arrays.toString(students));
- }
- }
