leetcode

文章目录

1. leetcode
   1. 704. 二分查找

leetcode

704. 二分查找

/**
 * @param {number[]} nums
 * @param {number} target
 * @return {number}
 */
var search = function(nums, target) {
    const n = nums.length
    let l = 0,
        r = n - 1
    while( l <= r) {
        const mid = Math.floor(l + (r - l) / 2) // 防止整型溢出 2^53 - 1
        if (nums[mid] === target) {
            return mid
        }

        if (nums[mid] > target) {
            r = mid - 1
        } else {
            l = mid + 1
        }
    }
    return -1
}