题解 | #二分查找-I#

/**
 * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
 *
 * 
 * @param nums int整型一维数组 
 * @param numsLen int nums数组长度
 * @param target int整型 
 * @return int整型
 */
int search(int* nums, int numsLen, int target ) {
    // write code here
    int low=0;
    int high = numsLen-1;
    int middle = (low+high)/2;

    while(low<=high){
        if(nums[middle]==target){
            return middle;
        }else if(nums[middle] < target) {
            low = middle+1;
            middle = (low+high)/2;
        }else {
            high = middle-1;
            middle = (low+high)/2;
        }
    }

    return  -1;
}