三种情况的模板,记忆一下一劳永逸
第一种情况:找到符合条件的地方,直接返回下标
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 ;
}
}
if ( left >= nums. length || nums[ left] != target)
return - 1 ;
return left;
}
第三种情况:返回右边界下标(这个右边界值是等于target的)
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 ;
}
}
if ( right < 0 || nums[ right] != target)
return - 1 ;
return right;
}