查找左边界
保证返回的下脚标id,id左侧的值均比查找值小,右侧的值大于或者等于查找值。
比如a[0,1,1,3,4,5,5,5,7]
查找1,返回1;
查找2,返回3;
查找5,返回5;
查找-1,返回0;
查找8,返回9;
int left_bound(int[] nums, int target) {
if (nums.length == 0) return -1;
int left = 0;
int 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; // 注意
}
}
return left;
}
查找右边界
保证返回的下脚标id,id右侧的值均比查找值大,左侧的值小于或者等于查找值。
比如a[0,1,1,3,4,5,5,5,7]
查找1,返回2;
查找2,返回2;
查找5,返回7;
查找-1,返回-1;
查找8,返回8;
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) {
left = mid + 1;
} else if (nums[mid] > target) {
right = mid;
}
}
return left - 1; // 注意
}