二分搜索套路模板
二分搜索可分为寻找某个数、寻找左侧边界、寻找右侧边界三类
//查找某个数,找到target就返回下标值,否则返回-1
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;
}
/* ------------------------------------------------------------------------------------- */
//查找target左边界
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;
}
}
// 判断 target 是否存在于 nums 中,防止数组越界
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;
}
}
// 由于 while 的结束条件是 right == left - 1,且现在在求右边界,防止数组越界
// 所以用 right 替代 left - 1 更好记
if (right < 0 || nums[right] != target) {
return -1;
}
return right;
}
当 target ⽐ nums 中所有元素都⼤时,会存在左边界不断收缩,left>right退出while循环,left位置超出数组长度的情况
当 target ⽐所有元素都⼩时, right 会被减到 -1,所以需要在最后防⽌越界