📚 4.找到第一个大于target的元素

💻 代码实现

/**
 * @url https://leetcode.cn/problems/binary-search/description/
 */

function search(nums, target) {
    let left = 0,
        right = nums.length - 1

    while (left <= right) {
        let mid = Math.floor((left + right) / 2)
        if (nums[mid] === target) return mid + 1
        if (nums[mid] < target) {
            left = mid + 1
        }
        if (nums[mid] > target) {
            right = mid - 1
        }
    }
    return left
}

console.log(search([1, 2, 3, 4, 5], 2))