二分查找

public class Test{
    public static void main(String[] args){
        int[] arr = {1,3,5,7,9,10,11,15,17}
        int find = 10;
        
        
        
      	
    }
    
    public static int binarySearch(int[] arr,int find){
        int left = 0;
        int right = arr.length - 1;
        
        while(left<=right){
            int mid = (right + left)/2
            if(find==arr[mid]){
                right = mid - 1;
            }else if(find<arr[mid]){
                return mid;
            }else{
                left = mid + 1;
            }
        }
        return -1;
    }
}