寻找一个数(基本的二分搜索)
int binarySearch ( int [ ] nums, int target) {
int left = 0 ;
int right = nums. length - 1 ;
while ( left <= right) {
int mid = left + ( right - left) / 2 ;
if ( nums[ mid] == target)
return mid;
else if ( nums[ mid] < target)
left = mid + 1 ;
else if ( nums[ mid] > target)
right = mid - 1 ;
}
return - 1 ;
}
寻找左侧边界的二分搜索
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;
}
寻找左侧边界的二分搜索–统一
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;
}
寻找右侧边界的二分查找
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 ;
}
寻找右侧边界的二分查找–统一
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;
}