TOP101题解 | BM17#二分查找-I#

/**
 * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
 *
 * @author Senky
 * @date 2023.04.23
 * @par url https://www.nowcoder.com/creation/manager/content/584337070?type=column&status=-1
 * @param nums int整型一维数组 
 * @param numsLen int nums数组长度
 * @param target int整型 
 * @return int整型
 */
int search(int* nums, int numsLen, int target ) {
    // write code here
    int left = 0;
    int right = numsLen - 1;
    
    int result = -1;
    while(left <= right)
    {
        int mid = (left + right)/2;
        if(nums[mid] == target)
        {
            result = mid;
            break;
        }
        else if(nums[mid] < target)
        {
            left = mid+1;
        }
        else if(nums[mid]>target)
        {
            right = mid-1;
           
        }
    }
    return result;
}