LeetCode 二 二分查找

public static int find(int []arr,int key){
    int low=0;
    int h = arr.length-1;

    while(low<=h){
        int mid =low+(h-1)/2;
        if(key==arr[mid]){
            return 1;
        }
        if(key<arr[mid]){
            h=h-1;
        }
        else{
            low = mid+1;
        }
    }
    return -1;
}