二分查找的应用

跨平台的程序元

于 2023-02-13 16:34:11 发布

阅读量118

点赞数

分类专栏：算法文章标签：算法数据结构 Powered by 金山文档

本文链接：https://blog.csdn.net/weixin_55516868/article/details/129011722

版权

算法专栏收录该内容

14 篇文章 0 订阅

订阅专栏

二分查找

public int binarySearch(int[] arr, int l, int r, int target) {
    int left = l;
    int right = r;
    while (left <= right) {
        int mid = left + ((right - left) >> 1);
        if (arr[mid] == target)
            return mid;
        else if (arr[mid] > target)
            right = mid - 1;
        else
            left = mid + 1;
    }
    return -1;
}

二分查找大于等于target的最左侧位置

//找大于等于target的最左位置
private int findMostLeftIndex(int[] arr, int l, int r, int target) {
    int left = l;
    int right = r;
    int index = 0;
    while (left <= right) {
        int mid = left + ((right - left) >> 1);
        if (arr[mid] >= target) {
            right = mid - 1;
            index = mid;
        } else {
            left = mid + 1;
        }
    }
    return index;
}

二分查找小于等于target的最右位置

//小于等于target的最右位置
private int findMostRightIndex(int[] arr, int l, int r, int target) {
    int left = l;
    int right = r;
    int index = 0;
    while (left <= right) {
        int mid = left + ((right - left) >> 1);
        if (arr[mid] <= target) {
            left = mid + 1;
            index = mid;
        } else {
            right = mid - 1;
        }
    }
    return index;
}