折半查找是面试中经常考到的算法,折半查找默认被查找元素是有序的(若未有序,首先要进行排序),折半查找需要注意的有三点:
1. 设置mid; mid = low + (high - low)/2; 保证整个公式不超出其数据类型规定的范围;若设置成mid = (low + high)/2,则若此时low和high都较大,则low+high会超出相应数据类型的范围。
二分查找:
public int binarySearch(int[] arr, int val) {
int low = 0;
int high = arr.length - 1;
int mid = 0;
while (low <= high) {
mid = low + (high - low) / 2;
if (val < arr[mid])
high = mid - 1;
else if (val > arr[mid])
low = mid + 1;
else
return mid; //找到相等的直接return
}
return -1;
}
- 寻找首次出现目标值的元素,此时设置变量poi,令poi等于与目标值相等的下标。然后更新high值,在相等元素值的左侧继续查找;直至high比low的位置小
//返回查找的最小元素
public int firstBinarySearch(int[] arr, int val){
int low = 0;
int high = arr.length -1;
int poi = 0;
int mid = 0;
while (low <= high){
mid = low + (high - low)/2;
if (val < arr[mid])
high = mid - 1;
else if (val > arr[mid])
low = mid + 1;
else { //找到相等的元素后,更新high值
poi = mid;
high = mid -1;
}
}
return poi;
}
- 寻找最后一次出现目标值的元素,此时设置变量poi,令poi等于与目标值相等的下标。然后更新low值,在相等元素值的右侧继续查找;直至low比high的位置大;返回poi的值;
//返回查找的最大元素
public int lastBinarySearch(int[] arr, int val){
int low = 0;
int high = arr.length - 1;
int poi = 0;
int mid = 0;
while (low <= high){
mid = low + (high - low)/2;
if (val < arr[mid])
high = mid -1;
else if (val > arr[mid])
low = mid +1;
else {
poi = mid;
low = mid + 1;
}
}
return poi;
}