public class Test {
public static void main(String[] args) {
int[] arr = {1, 2, 4, 6, 7, 12, 45, 67};
int target = 0;
int index = binarySearch(arr, target);
System.out.println(index);
}
private static int binarySearch(int[] arr, int target) {
int left = 0, right = arr.length - 1;
while (left <= right) {
int mid = (left + right) / 2;
if (target == arr[mid]) {
return mid;
} else if (target > arr[mid]) {
left = mid + 1;
} else {
right = mid - 1;
}
}
return -1;
}
}
Java实现二分查找
最新推荐文章于 2024-09-15 19:46:31 发布