最基本的二分法查找
因为我们初始化 right = nums.length - 1
所以决定了我们的「搜索区间」是 [left, right]
所以决定了while (left ‹= right)
同时也决定了 left = mid+1 和 right = mid-1因为我们只需找到一个 target 的索引即可
所以当 nums[mid] == target 时可以立即返回
寻找左侧边界的二分查找:
因为我们初始化 right = nums.length
所以决定了我们的「搜索区间」是 [left, right)
所以决定了 while (left ‹ right)
同时也决定了 left = mid + 1 和 right = mid因为我们需找到 target 的最左侧索引
所以当 nums[mid] == target 时不要立即返回
而要收紧右侧边界以锁定左侧边界
寻找右侧边界的二分查找:
因为我们初始化 right = nums.length
所以决定了我们的「搜索区间」是 [left, right)
所以决定了 while (left ‹ right)
同时也决定了 left = mid + 1 和 right = mid因为我们需找到 target 的最右侧索引
所以当 nums[mid] == target 时不要立即返回
而要收紧左侧边界以锁定右侧边界又因为收紧左侧边界时必须 left = mid + 1
所以最后无论返回 left 还是 right,必须减一
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;
}
//https://leetcode-cn.com/problems/find-first-and-last-position-of-element-in-sorted-array/
public int[] searchRange(int[] nums, int target) {
int[] results = new int[]{-1, -1};
if (nums.length == 0) {
return results;
}
results[0] = leftBound(nums, target);
results[1] = rightBound(nums, target);
return results;
}
private int leftBound(int[] nums, int target) {
int left = 0, right = nums.length - 1;
while (left <= right) {
int mid = left + (right - left) / 2;
int t = nums[mid];
if (t < target) {
left = mid + 1;
} else if (t > target) {
right = mid - 1;
} else if (t == target) {
right = mid - 1;
}
}
if (left >= nums.length || nums[left] != target) {
return -1;
}
return left;
}
private int rightBound(int[] nums, int target) {
int left = 0, right = nums.length - 1;
while (left <= right) {
int mid = left + (right - left) / 2;
int t = nums[mid];
if (t < target) {
left = mid + 1;
} else if (t > target) {
right = mid - 1;
} else if (t == target) {
left = mid + 1;// 别返回,锁定右侧边界
}
}
// 最后要检查 right 越界的情况
if (right < 0 || nums[right] != target) {
return -1;
}
return right;
}