二分算法（java）

前言

水平有限，欢迎交流

应用场景

题目满足单调性，即mid如满足题意，则mid一侧均满足，另一侧均不满足，此时适合使用二分
(注意：/：向下截断取整因此在第一种情况下一定记住加一！)

视频链接

【【算法精讲系列】基础算法：二分法 | 从此告别死循环】https://www.bilibili.com/video/BV11A411R7BK?vd_source=d40f68483c8501ae1703de6cc0b5b7d1
【二分查找 红蓝染色法】 https://www.bilibili.com/video/BV1AP41137w7/?share_source=copy_web&vd_source=d40f68483c8501ae1703de6cc0b5b7d1

经典试题

Leetcode 34；
蓝桥杯
199
364
3510

左满足右不满足

枚举最后一个满足条件解

static void binary_search_last_satisfied(int []arr){

        int left = 0, right = arr.length-1;

        while (left < right){

            int mid = left + right + 1 >> 1;

            if (arr[mid]<10){

                left = mid;

            }

            else{

                right = mid - 1;

            }

        }

        System.out.println("满足条件的最后一个元素为：" + arr[left]);

    }

枚举第一个不满足条件解

static void binary_search_first_unsatisfied(int []arr){

        int left = 0, right = arr.length-1;

        while (left < right){

            int mid = left + right>> 1;

            if (arr[mid]<10){

                left = mid + 1;

            }

            else{

                right = mid;

            }

        }

        System.out.println("不满足条件的第一个元素为：" + arr[left]);

    }

左不满足右满足

枚举最后一个满足条件解

static void binary_search_last_satisfied_reverse(int []arr){

        int left = 0, right = arr.length-1;

        while (left < right){

            int mid = left + right + 1  >> 1; // 2

            if (arr[mid]>9){

                right = mid - 1;

            }

            else{

                left = mid;

            }

        }

        System.out.println("不满足条件的最后一个元素为：" + arr[left]);

    }

枚举第一个不满足条件解

static void binary_search_first_unsatisfied_reverse(int []arr){

        int left = 0, right = arr.length-1;

        while (left < right){

            int mid = left + right>> 1;

            if (arr[mid]>9){

                right = mid;

            }

            else{

                left = mid + 1;

            }

        }

        System.out.println("满足条件的第一个元素为：" + arr[left]);

    }

总结

在二分时出现 left = mid 时 int mid = left + right + 1>>1; 避免出现死循环

public class Main {

    static int []arr ={1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20};

    //左满足右不满足：

    static void binary_search_last_satisfied(int []arr){

        int left = 0, right = arr.length-1;

        while (left < right){

            int mid = left + right + 1 >> 1;

            if (arr[mid]<10){

                left = mid;

            }

            else{

                right = mid - 1;

            }

        }

        System.out.println("满足条件的最后一个元素为：" + arr[left]);

    }

    static void binary_search_first_unsatisfied(int []arr){

        int left = 0, right = arr.length-1;

        while (left < right){

            int mid = left + right>> 1;

            if (arr[mid]<10){

                left = mid + 1;

            }

            else{

                right = mid;

            }

        }

        System.out.println("不满足条件的第一个元素为：" + arr[left]);

    }

    //左不满足右满足：

    static void binary_search_last_satisfied_reverse(int []arr){

        int left = 0, right = arr.length-1;

        while (left < right){

            int mid = left + right + 1  >> 1; // 2

            if (arr[mid]>9){

                right = mid - 1;

            }

            else{

                left = mid;

            }

        }

        System.out.println("不满足条件的最后一个元素为：" + arr[left]);

    }

    static void binary_search_first_unsatisfied_reverse(int []arr){

        int left = 0, right = arr.length-1;

        while (left < right){

            int mid = left + right>> 1;

            if (arr[mid]>9){

                right = mid;

            }

            else{

                left = mid + 1;

            }

        }

        System.out.println("满足条件的第一个元素为：" + arr[left]);

    }

    public static void main(String[] args) {

        binary_search_last_satisfied(arr);

        binary_search_first_unsatisfied(arr);

        binary_search_last_satisfied_reverse(arr);

        binary_search_first_unsatisfied_reverse(arr);

    }

}