【力扣算法刷题笔记】1.二分查找

定义

二分查找：在升序数组nums中寻找目标值target，对于特定下标ii，比较nums[i]和target的大小：

• 如果nums[i]=target，则下标 ii 即为要寻找的下标；
• 如果nums[i]>target，则target 只可能在下标 ii 的左侧；
• 如果nums[i]<target，则target 只可能在下标 ii 的右侧。

笔记

主要注意两点：
（1）middle=Math.floor((right - left) / 2) + left;
（2）因为不用和middle比较所以要+1或-1
nums[i] > targt时，在i左侧，所以要改变右侧right=middle-1
nums[i] < targt时，在i右侧，所以要改变左侧left=middle+1

代码

练习一：二分查找

地址：https://leetcode-cn.com/problems/binary-search/

/**
 * @param {number[]} nums
 * @param {number} target
 * @return {number}
 */
var search = function(nums, target) {
    let len = nums.length;
    let left = 0, right = len - 1;
    while(left <= right) {
        let middle = Math.floor((right - left) / 2) + left; 
        if(nums[middle] > target) {
            right = middle - 1;
        } else if (nums[middle] < target) {
            left = middle + 1;
        } else if (nums[middle] === target) {
            return middle;
        }
    }
    return -1;
};

练习二：第一个错误版本

地址：https://leetcode-cn.com/problems/first-bad-version/

/**
 * Definition for isBadVersion()
 * 
 * @param {integer} version number
 * @return {boolean} whether the version is bad
 * isBadVersion = function(version) {
 *     ...
 * };
 */

/**
 * @param {function} isBadVersion()
 * @return {function}
 */
var solution = function(isBadVersion) {
    /**
     * @param {integer} n Total versions
     * @return {integer} The first bad version
     */
    return function(n) {
        let left = 0, right = n - 1;
        while(left <= right) {
            let middle = left + Math.floor((right - left) / 2);
            if(isBadVersion(middle)) {
                right = middle - 1;
            } else {
                left = middle + 1;
            }
        }
        return left
    };
};

练习三：搜索插入位置

地址： https://leetcode-cn.com/problems/search-insert-position/

/**
 * @param {number[]} nums
 * @param {number} target
 * @return {number}
 */
var searchInsert = function(nums, target) {
    let left = 0, right = nums.length - 1;
    while(left <= right) {
        let mid = left + Math.floor((right - left) / 2);
        if (nums[mid] < target) {
            left = mid + 1;
        } else if (nums[mid] > target) {
            right = mid - 1;
        } else if(nums[mid] == target) {
            return mid;
        }
    }
    return nums[right] > target ? right - 1 : right + 1;
};

练习四：34. 在排序数组中查找元素的第一个和最后一个位置

地址：https://leetcode-cn.com/problems/find-first-and-last-position-of-element-in-sorted-array/
思路：使用二分法找两次，一次最左边一次最右边

const binarySearch = (nums, target, lower) => {
    let left = 0, right = nums.length - 1, ans = nums.length;
    while (left <= right) {
        const mid = Math.floor((left + right) / 2);
        if (nums[mid] > target || (lower && nums[mid] == target)) {
            right = mid - 1;
            ans = mid;
        } else {
            left = mid + 1;
        }
    }
    return ans;
}

var searchRange = function(nums, target) {
    let ans = [-1, -1];
    const leftIdx = binarySearch(nums, target, true);
    const rightIdx = binarySearch(nums, target, false) - 1;
    if (leftIdx <= rightIdx && rightIdx < nums.length && nums[leftIdx] === target && nums[rightIdx] === target) {
        ans = [leftIdx, rightIdx];
    } 
    return ans;
};

练习五：69. x 的平方根

地址：https://leetcode-cn.com/problems/sqrtx/
思路：平方根肯定在中间或者之前，可以拿mid的平方和x比较

/**
 * @param {number} x
 * @return {number}
 */
var mySqrt = function(x) {
  let left = 0, right = x, ans;
  while(left <= right) {
    let mid = Math.floor((left + right) / 2);
    if(mid * mid > x) {
      right = mid - 1;
    } else if (mid * mid <= x) {
      left = mid + 1
      ans = mid;
    }
  }
  return ans;
};