算法通关村第九关|青铜|二分查找-CSDN博客

本文链接：https://blog.csdn.net/m0_57130776/article/details/134314393

凡是涉及到在排好序的地方（不一定是整体，排好序的部分也可以）查找的都可以考虑用二分来优化查找效率，如果知道大体位置了，也可以不折半而是找更高效的计算方法。

插值查找的公式：mid=low+(key-a[low])/(a[high]-a[low])*(high-low) 。

1.顺序查找

int search(int[] a, int key) {
	for (int i = 0; i < a.length; i++) {
        if (a[i] == key) {
            return i;
        }
    }
    return -1;
}

2.二分查找与分治

二分查找可以说是最简单、最典型的分治。

*2.1循环方式的二分查找

public static int binarySearch(int[] array, int low, int high, int target) {
	while (low <= high) {
        int mid = low + ((high - low) >> 1);
        if (array[mid] == target) {
            return mid;
        } else if (array[mid] > target) {
            high = mid - 1;
        } else {
            low = mid + 1;
        }
    }
    return -1;
}

*2.2递归方式的二分查找

public int binarySearch(int[] array, int low, int high, int target) {
	if (low <= high) {
        int mid = low + ((high - low) >> 1);
        if (array[mid] == target) {
            return mid;
        } else if (array[mid] > target) {
            return binarySearch(array, low, mid - 1, target);
        } else {
            return binarySearch(array, mid + 1, high, target);
        }
    }
    return -1;
}

3.元素中有重复的二分查找

重复的值要左侧第一个。

public int search(int[] nums, int target) {
	if (nums == null || nums.length == 0) {
        return -1;
    }
    int left = 0;
    int right = nums.length - 1;
    while (left <= right) {
        int mid = left + ((right - left) >> 1);
        if (nums[mid] < target) {
            left = mid + 1;
        } else if(nums[mid] > target) {
            right = mid - 1;
        } else {
            while (mid != 0 && nums[mid] == target) {
                mid--;
            }
            if (mid == 0 && nums[mid] == target) {
                return mid;
            }
            return mid + 1;
        }
    }
    return -1;
}