包含重复元素的二分查找

public class BinarySearchFirstOne {
    public static void main(String[] args) {
        int[] arr = {1,2,3,3,3,4,5,5,6,7,7,7,8,9,9};
        int target = 7;
        
        System.out.println(search(arr, target));

    }
    public static int search(int[] arr, int target) {
        int lo = 0;
        int hi = arr.length - 1;
        int mid;
        while(lo < hi) {
            mid = (lo + hi) >> 1;
            if(arr[mid] < target) {
                lo = mid +1;
            }
            else
                hi = mid;
        }
        if(arr[lo] == target) {
            return lo;
        }
        else
            return -1;
    }
}