[35] 搜索插入位置

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