你可以用Java实现二分法查找代码吗

可以，以下是Java实现二分法查找的代码：

public static int binarySearch(int[] arr, int target) {
int left = ;
int right = arr.length - 1;
while (left <= right) {
int mid = left + (right - left) / 2;
if (arr[mid] == target) {
return mid;
} else if (arr[mid] < target) {
left = mid + 1;
} else {
right = mid - 1;
}
}
return -1;
}