java实现二分查找:
边界值:1整数-2147483647~2147483647,(start+end)/2可能产生越界。2,查找不到最后一个或第一个值。可以在比较到最后两个数时,再次判断到底是哪个值和查找的值相等。可以在while循环的时候start<=end即可。
public class TwoInsearch {
private static int[] A = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
private static int insearch(int key, int start, int end) {
int mid = start + (end - start) / 2;
while (start <= end) {
if (A[mid] < key) {
start = mid + 1;
} else if (A[mid] > key) {
end = mid - 1;
} else {
return mid;
}
mid = start + (end - start) / 2;
}
return 0;
}
public static void main(String[] args) {
System.out.println(insearch(7, 1, 9));
}
}
三种常用的查找要求的实现:
1)给定一个有序(非降序)数组arr,求第一个i使得arr[i]等于value,不存在返回-1。
public class TwoInsearch {
private static int[] A = { 0, 1, 2, 3, 4, 4, 4, 5, 6, 7, 8, 9 };
private static int insearch(int key, int start, int end) {
int mid = start + (end - start) / 2;
while (start <= end) {
if (A[mid] < key) {
start = mid + 1;
} else if (A[mid] > key) {
end = mid - 1;
} else {
//添加查询第一个相等
while(A[mid]==key){
mid=mid-1;
}
return mid+1;
}
mid = start + (end - start) / 2;
}
return -1;
}
public static void main(String[] args) {
System.out.println(insearch(4, 1, 11));
}
}
2)
给定一个有序(非降序)数组arr,求最后一个i使得arr[i]等于value,不存在返回-1
public class TwoInsearch {
private static int[] A = { 0, 1, 2, 3, 4, 4, 4, 5, 6, 7, 8, 9 };
private static int insearch(int key, int start, int end) {
int mid = start + (end - start) / 2;
while (start <= end) {
if (A[mid] < key) {
start = mid + 1;
} else if (A[mid] > key) {
end = mid - 1;
} else {
//添加查询最后一个相等
while(A[mid]==key){
mid=mid+1;
}
return mid-1;
}
mid = start + (end - start) / 2;
}
return -1;
}
public static void main(String[] args) {
System.out.println(insearch(4, 1, 11));
}
}