思路:(1)先将数组内元素按从小到大顺序排好
(2)声明两个变量,一个最小值low:0,一个最大值high:数组.length-1,再在循环中声明一个变量middle:(low +high)/2
(3)判断:如果middle=目标元素,return middle;如果middle>目标元素,high=middle-1;如果middle<目标元素,low=middle+1;
平均时间复杂度:O(log(n))
//二分法查找;(折半查找)
public class BinarySearchTest {
public static int binarySearch(int[] array,int value){
int low = 0;//low--high是查找区间,low开始位置,high结束位置;
int high = array.length - 1;
while(low <= high){
int middle = (low+high) / 2;
if(value == array[middle]){
return middle;
}
if (value < array[middle]){
high = middle-1;
}
if (value > array[middle]){
low = middle + 1;
}
}
return -1;//如果array数组中没有要查找的value值,则返回-1;
}
}
class Solution {
public int search(int[] nums, int target) {
int left = 0, right = nums.length - 1;
while(left<=right) {
int mid = left + (right - left) / 2;
if(nums[mid] == target) {
return mid;
} else if(nums[mid] > target) {
right = mid - 1;
} else {
left = mid + 1;
}
}
return -1;
}
}