35. 搜索插入位置（算法200题-23）

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