题解 | #二分查找-I#

int search(int* nums, int numsLen, int target ) {
    // write code here
    if(numsLen==0)
        return -1;
    
    int low=0,mid=numsLen/2,high=numsLen-1;
    while(low<=high)
    {
        if(nums[mid]==target)
            return mid;
        else if(nums[mid]<target)
        {
            low=mid+1;
            mid=(high+low)/2;
        }
        else
        {
           high=mid-1;
           mid=(high+low)/2; 
        }
    }
    
    return -1;
}