二分查找,寻找左侧边界,寻找右侧边界

这个场景是最简单的，肯能也是大家最熟悉的，即搜索一个数，如果存在，返回其索引，否则返回 -1

int binarySearch(int[] nums, int target) {
	int left = 0, right = nums.length - 1;
	while (left <= right) {
		int mid = left + (right - left)/2;
		if (nums[mid] == target) {
			return mid;
		}else if (nums[mid] > target) {
			right = mid - 1;
		}else if(nums[mid] < target) {
			left = mid + 1;
		}
	}
	return -1;
}

寻找左边界二分查找

int left_bound(int[] nums, int target) {
	if (nums.length == 0) return -1;
	int left = 0, right = nums.length;
	while (left < right) {
		int mid = (left + right) / 2;
		if (nums[mid] == target) {
			right = mid;
		}else if (nums[mid] < target) {
			left = mid + 1;
		}else if (nums[mid] > target) {
			right = mid;
		}
	}
	// 两种情况:一种是target比数组中的所有元素都小, 二种是target比数组中所有的元素都大
	// 一: target = 0, nums = [1, 2, 3, 3], 最后left = 0,right = 0, nums[left] != target,返回-1
	// 最后left = 0表示target比数组中的所有元素都小    也就是     数组中比0小的数有0个
	//二: target = 4, nums[1, 2, 3, 3],最后left = nums.length, 
	// 最后left = 4 表示target = 4这个数比数组中的所有元素都大,    也就是     数组中比4小的元素的个数有4个
	if (nums[left] != target || left >= nums.length) {return -1}
	return left;
}

寻找右边界

int right_bound(int[] nums, int target) {
	if (nums.length == 0) return -1;
	int left = 0, right = nums.length;
	while (left < right) {
		int mid = (left + right)/2;
		if (nums[mid] == target) {
			left = mid + 1;
		}else if (nums[mid] > target) {
			right = mid;
		}else if (nums[mid] < target) {
			left = mid + 1;
		}		
	}
	if (left == 0) return -1; // target比数组中所有元素都小
	return nums[left - 1] == target ? (left - 1) : -1; // nums[left - 1] != target 表示target比数组中所有的元素都大

}

我们还根据逻辑将「搜索区间」全都统一成了两端都闭，便于记忆，只要修改两处即可变化出三种写法：

int binary_search(int[] nums, int target) {
    int left = 0, right = nums.length - 1; 
    while(left <= right) {
        int mid = left + (right - left) / 2;
        if (nums[mid] < target) {
            left = mid + 1;
        } else if (nums[mid] > target) {
            right = mid - 1; 
        } else if(nums[mid] == target) {
            // 直接返回
            return mid;
        }
    }
    // 直接返回
    return -1;
}

int left_bound(int[] nums, int target) {
    int left = 0, right = nums.length - 1;
    while (left <= right) {
        int mid = left + (right - left) / 2;
        if (nums[mid] < target) {
            left = mid + 1;
        } else if (nums[mid] > target) {
            right = mid - 1;
        } else if (nums[mid] == target) {
            // 别返回，锁定左侧边界
            right = mid - 1;
        }
    }
    // 最后要检查 left 越界的情况
    if (left >= nums.length || nums[left] != target)
        return -1;
    return left;
}
int right_bound(int[] nums, int target) {
    int left = 0, right = nums.length - 1;
    while (left <= right) {
        int mid = left + (right - left) / 2;
        if (nums[mid] < target) {
            left = mid + 1;
        } else if (nums[mid] > target) {
            right = mid - 1;
        } else if (nums[mid] == target) {
            // 别返回，锁定右侧边界
            left = mid + 1;
        }
    }
    // 最后要检查 right 越界的情况
    if (right < 0 || nums[right] != target)
        return -1;
    return right;
}

二分查找详解