题解 | 二分查找-I

/**
 * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
 *
 *
 * @param nums int整型一维数组
 * @param target int整型
 * @return int整型
 * @ 解题的关键在于要记住下标，用递归的话会比较麻烦
 */
function search(nums, target) {
    // write code here
    let mid = Math.floor(nums.length / 2);
    let start = 0;
    let end = nums.length - 1;
    while (mid >= start && mid <= end) {
        if (nums[mid] === target) return mid;
        else if (nums[mid] > target) {
            end = mid - 1;
        } else {
            start = mid + 1;
        }
        mid = Math.floor((start + end) / 2);
    }
    return -1;
}
module.exports = {
    search: search,
};