Arrays.sort()深入理解

一维数组的排序

       int[] b = new int[]{-1, -2, -3, -4, -5};
          Arrays.sort(b);

二维数组对行整体排序

            int [][] nums1 =new int[][]{{-3,3},{-1,2},{2,9},{-1,1}};
               Arrays.sort(nums1,new Comparator<int[]>(){//对行整体排序//(a-b)->(a[1]-b[1])
            public int compare(int[] a,int[] b){
                return a[1]-b[1];//冒泡升序
            }
        });
        for(int i = 0;i<4;i++)
        System.out.println(Arrays.toString(nums1[i]));

对象数组的排序

package Test09;
import java.util.*;
public class Test {
    public static void main(String args[]) {
        Student []students = new Student[]{new Student("yang",10),new Student("huang",2),new Student("yang",8)};
        Arrays.sort(students, new Comparator<Student>() {//这里需要注意的是，比较器与compareTo(),比较器优先
            @Override
            public int compare(Student o1, Student o2) {
                if(!o1.name.equals(o2.name))
                    return o1.name.compareTo(o2.name);//冒泡升序
                return o1.age-o2.age;//冒泡升序
            }
        });
        System.out.println(Arrays.toString(students));

    }
}
class Student implements Comparable<Student>{
    String name;
    int age;
    Student(String name,int age){
        this.name = name;
        this.age = age;
    }
    @Override
    public String toString(){
        return name+" "+age;
    }

    @Override
    public int compareTo(Student o2) {//这里相当于c++重载运算符<
        if(!name.equals(o2.name))
            return o2.name.compareTo(name);//冒泡降序
        return age-o2.age;//冒泡升序
    }
}