binarySearch二叉搜索

一、引用类型

1、数组（java.util.Arrays）

public static int binarySearch(Object[] a, Object key)

public static int binarySearch(T[] a, T key, Comparator<? super T> c)

     	// 自然排序
        Integer[] ints = {12, 10, 66};
        Arrays.sort(ints);
        System.out.println(Arrays.toString(ints));         // [10, 12, 66]
        System.out.println(Arrays.binarySearch(ints, 10)); // 0

        // 定制排序
        String[] strs = {"c++", "java", "php"};
        Arrays.sort(strs, Collections.reverseOrder()); 
        System.out.println(Arrays.toString(strs));             // [php, java, c++]
        System.out.println(Arrays.binarySearch(strs, "java")); // 1

2、List集合（java.util.Collections）

public static int binarySearch(List<? extends Comparable<? super T>> list, T key)

public static int binarySearch(List<? extends T> list, T key, Comparator<? super T> c)

  		// 自然排序
        List<Integer> ints = Arrays.asList(12, 38, 10);
        Collections.sort(ints); // 升序
        System.out.println(ints);                               // [10, 12, 38]
        System.out.println(Collections.binarySearch(ints, 10)); // 0

        // 定制排序
        List<String> strs = Arrays.asList("c++", "java", "php");
        Collections.sort(strs, Collections.reverseOrder()); 
        System.out.println(strs);                                   // [php, java, c++]
        System.out.println(Collections.binarySearch(strs, "java")); // 1

二、自定义类型

1、自然排序

// Person类
public class Person implements Comparable<Person> {
    private String name;
    private int age;

    public Person() {
    }

    public Person(String name, int age) {
        this.name = name;
        this.age = age;
    }

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

    // 重写toString()方法
    @Override
    public String toString() {
        return "Person{" +
                "name='" + name + '\'' +
                ", age=" + age +
                '}';
    }

    // 重写compareTo(T o)方法
    @Override
    public int compareTo(Person o) {
        return this.age - o.age; // 年龄升序
    }
}

// Test类
public class Test{
    public static void main(String[] args) {
        List<Person> persons = new ArrayList<>();
        persons.add(new Person("鱼悠奕",26));
        persons.add(new Person("啦啦啦",25));
        Collections.sort(persons);
        System.out.println(persons); 
        // [Person{name='啦啦啦', age=25}, Person{name='鱼悠奕', age=26}]  1
        System.out.println(Collections.binarySearch(persons, new Person("鱼悠奕", 26))); 
    }
}

2、定制排序

// Student类
public class Student {
    private String name;
    private int age;

    public Student() {
    }

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

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

    // 重写toString()方法
    @Override
    public String toString() {
        return "Student{" +
                "name='" + name + '\'' +
                ", age=" + age +
                '}';
    }
}

// Test类
public class Test{
    public static void main(String[] args){
        List<Student> students = new ArrayList<>();
        students.add(new Student("Zoom", 10));
        students.add(new Student("Mike", 15));
        Comparator<Student> comparator = new Comparator<>() { // 匿名内部类
            // 重写compare(T o1, T o2)方法 
            @Override
            public int compare(Student o1, Student o2) {
                int i = o1.getName().charAt(0) - o2.getName().charAt(0); // 姓名升序
                if (i == 0) {
                    i = o2.getAge() - o1.getAge(); // 年龄降序
                }
                return i;
            }
        };
        Collections.sort(students, comparator);
        System.out.println(students);
        // [Student{name='Mike', age=15}, Student{name='Zoom', age=10}]  0
        System.out.println(Collections.binarySearch(students, 
                                                    new Student("Mike", 15), 
                                                    comparator));
    }
}