public static int binarySearch(int [] a, int target) {
int len = a.length;
int l = 0;
int r = len - 1;
while(l <= r) {
int mid = (l+r)/2;
if (target == a[mid]) {
return mid;
}
if (a[mid] < target) {
l = mid + 1;
}else {
r = mid - 1;
}
}
return -1;
}
二分查找
最新推荐文章于 2024-10-09 22:28:58 发布