【数据结构】二分查找模板&几个变体的写法(Java)

O、常规写法 找一个元素等于给定值

关于mid

mid = (low + high) / 2//可能会溢出，不用这个写法
mid = low + (high - low) / 2;//防止溢出
mid = low + ((high - low) >> 1);//用位运算性能更优☆
mid = (low+ high) >>> 1;//左中位数
mid = ( low+ high+ 1)>>>1;//右中位数
一般都用左中位数

循环条件是low<=high的写法

public int search(int[] nums, int low, int high, int target){
   
        while(low <= high){
   
            int mid = low + (high - low) / 2;
            if(nums[mid] == target){
   
                return mid;
            }else if(nums[mid] < target){
   
                low = mid + 1;
            }else{
   
       			high = mid - 1;
                }
            }
        }
        return -1;
    }

循环条件是low<high的写法

public int search(int[] nums, int low, int high, int target){