/*
* 二分查找
*/
static int myBinaryseach(int[] nums, int target) {
int left = 0;
int right = nums.length-1;
while(left <= right) {
int mid = ((right - left) >>1)+left;
if(target > nums[mid]) {
left = mid+1;
}
else if(target < nums[mid]) {
right = mid-1;
}
else
return mid;
}
return -1;
}
二分法
最新推荐文章于 2024-04-11 20:59:09 发布