704. 二分查找 - 力扣(LeetCode)
朴素二分查找模板:文章来源:https://www.toymoban.com/news/detail-856454.html
while(.......){
//防止溢出
int mid = left+(right - left)/2;
if(........){
right = mid-1;
}else if(......){
left = mid+1;
}else{
return mid;
}
}
代码:文章来源地址https://www.toymoban.com/news/detail-856454.html
public int search(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){
right = mid-1;
}else if(nums[mid] < target){
left = mid+1;
}else{
return mid;
}
}
return -1;
}
到了这里,关于每日一题 — 二分查找的文章就介绍完了。如果您还想了解更多内容,请在右上角搜索TOY模板网以前的文章或继续浏览下面的相关文章,希望大家以后多多支持TOY模板网!