/*
 * @lc app=leetcode.cn id=35 lang=javascript
 *
 * [35] 搜索插入位置
 */

// @lc code=start
/**
 * @param {number[]} nums
 * @param {number} target
 * @return {number}
 */
var searchInsert = function (nums, target) {
  const len = nums.length;
  let left = 0;
  let right = len - 1;

  while (left <= right) {
    let mid = (left + right) >> 1;
    let cur = nums[mid];
    if (cur === target) return mid;

    if (cur > target) {
      right = mid - 1;
    } else {
      left = mid + 1;
    }
  }

  return left;
};
// @lc code=end
console.log(searchInsert([1, 3, 5, 6], 5))
console.log(searchInsert([1, 3, 5, 6], 2))
console.log(searchInsert([1, 3, 5, 6], 7))