Java二分搜索

搜索某个值

 public int binarySearch(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) {
                left=mid+1;
            }else if(nums[mid]>target){
                right=mid-1;
            }
        }
        return -1;
    }

搜索左侧边界

public int leftBound(int[]nums,int target){
        int left=0,right=nums.length-1;
        while (left<=right){
            int mid=left+(right-left)/2;
            if(nums[mid]==target){
                right=mid-1;
            } else if (nums[mid]<target) {
                left=mid+1;
            }else if(nums[mid]>target){
                right=mid-1;
            }
        }
        if(left>=nums.length || left<0) return -1;
        return nums[left]==target?left:-1;
//        return left;
    }

搜索右侧边界

public int rightBound(int[]nums,int target){
        int left=0,right=nums.length-1;
        while (left<=right){
            int mid=left+(right-left)/2;
            if(nums[mid]==target){
                left=mid+1;
            } else if (nums[mid]<target) {
                left=mid+1;
            }else if(nums[mid]>target){
                right=mid-1;
            }
        }
        if(right>=nums.length || right<0) return -1;
        return nums[right]==target?right:-1;
    }