Arrays

Arrays类

• 数组操作工具类，专门用于操作数组元素的

Arrays类的常用API

toString

• 返回数组内容

int[] arr = {7,2,3,1,5,6};
System.out.println(arr)  //打印地址
System.out.println(Arrays.toString(arr)) //打印数组内容

sort

• 进行升序排序

int[] arr = {7,2,3,1,5,6};
Arrays.sort(arr);
System.out.println(Arrays.toString(arr));
// [1,2,3,5,6,7]

binarySearch（arr,查找的数）

• 二分搜索技术（数组必须排好序，否则出bug）
• 找到返回索引，找不到返回你按照顺序排的索引的负数再-1

int[] arr = {1,2,3,4,5,6,7};
int index = Arrays.binarySearch(arr,3);
System.out.println(index); // 2
int index1 = Arrays.binarySearch(arr,8);
System.out.println(index1); // -8

Arrays类对Comparator比较器的支持

• 因为泛型需要是引用类型
• 升序排序规则
• 如果认为左边数据大于右边数据 返回正整数
• 如果认为左边数据小于右边数据 返回负整数
• 如果认为左边数据等于右边数据 返回0
• Double.compare(double a,double b);

public static void main(String[] args) {
        Integer[] arr = {3,8,1,5,9,1,3};
        Arrays.sort(arr, new Comparator<Integer>() {
            @Override
            public int compare(Integer o1, Integer o2) {
                return o2-o1;     //降序
                //return o1 -o2;  //升序
                /*if(o1>o2){      //升序
                    return 1;
                }else if(o1<o2){
                    return -1;
                }
                return 0;*/
            }
        });
        System.out.println(Arrays.toString(arr));
    }

学生信息排序
1.先创建一个学生类

public class Student {
    private String name;
    private int age;
    private double height;

    public Student() {
    }

    public Student(String name, int age, double height) {
        this.name = name;
        this.age = age;
        this.height = height;
    }

    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;
    }

    public double getHeight() {
        return height;
    }

    public void setHeight(double height) {
        this.height = height;
    }

    @Override
    public String toString() {
        return "Student{" +
                "name='" + name + '\'' +
                ", age=" + age +
                ", height=" + height +
                '}';
    }
}

2.进行排序
年龄排序和身高排序

public static void main(String[] args) {
       Student[] student = new Student[3];
       student[0] = new Student("张三",20,165.9);
       student[1] = new Student("李四",10,185.9);
       student[2] = new Student("王五",19,175.9);
        Arrays.sort(student, new Comparator<Student>() {
            @Override
            public int compare(Student o1, Student o2) {
                //return o1.getAge()-o2.getAge();  //按照年龄升序
                //return o2.getAge()-o1.getAge();  //按照年龄降序
                //return Double.compare(o1.getHeight(),o2.getHeight()); //因为返回的是int类型，需要用compare方法，按照身高升序
                return Double.compare(o2.getHeight(),o1.getHeight()); //按照身高降序
            }
        });
        System.out.println(Arrays.toString(student));
    }