技巧 二分搜索

二分查找框架

function binarySearch(nums, int target) {
    let left = 0, right = ...;

    while(...) {
        int mid = left + (right - left) / 2;
        if (nums[mid] == target) {
            ...
        } else if (nums[mid] < target) {
            left = ...
        } else if (nums[mid] > target) {
            right = ...1
        }
    }
    return ...;
}