二分查找的前提是数组已经排好序了。
循环实现
//循环写法
public static int search(int[] nums, int target) {
int left=0;
int right=nums.length-1;
int mid = (left+right) / 2;
while(left<=right) {
if (target < nums[mid]) {
right = mid - 1;
} else if (target > nums[mid]) {
left = mid + 1;
} else
return mid;
}
return -1;
}
解释一点:right=mid-1,left=mid+1为什么这么写。原因有二
1,我们排除了nums[i]的可能,那么我们下次循环的时候就可以直接绕过他,+-1可以前移一位。
2,如果我们要寻找的数字并不在数组中,那么直接写right=mid,left=mid,最终mid指针会和左边界或右边界两两挨着,就会陷入while的死循环,那就无法return -1;(我们可以举一个例子:[0,2,3,4,5,6]找1 )所以,我们+-1来跳出死循环。
递归写法
//递归写法
public static int search(int[] nums,int target,int left,int right){
int mid=(left+right)/2;
if(target==nums[mid]){
return mid;
}
else if(target<nums[mid]){
search(nums,target,0,nums[mid]-11);
}
else
search(nums,target,nums[mid]+1, nums.length-1 );
return -1;
}
测试一下
package com.ccit.SequenceList.org.lqbei;
public class NO2 {
public static void main(String[] args) {
int [] arr={1,2,3,4,5,6};
System.out.println(search(arr,3));
System.out.println(search(arr,3,0,arr.length-1));
}
//循环写法
public static int search(int[] nums, int target) {
int left=0;
int right=nums.length-1;
int mid = (left+right) / 2;
while(left<=right) {
if (target < nums[mid]) {
right = mid + 1;
} else if (target > nums[mid]) {
left = mid - 1;
} else
return mid;
}
return -1;
}
//递归写法
public static int search(int[] nums,int target,int left,int right){
int mid=(left+right)/2;
if(target==nums[mid]){
return mid;
}
else if(target<nums[mid]){
search(nums,target,0,nums[mid]+1);
}
else
search(nums,target,nums[mid]-1, nums.length-1 );
return -1;
}
}