Skip to content
On this page

https://leetcode-cn.com/problems/search-insert-position/

js
var searchInsert = function (nums, target) {
  let len = nums.length;
  let left = 0,
    right = len - 1;
  while (left <= right) {
    let middle = left + ((right - left) >> 1);
    if (nums[middle] > target) {
      right = middle - 1;
    } else if (nums[middle] < target) {
      left = middle + 1;
    } else {
      return middle;
    }
  }
  return right + 1;
};

优解

Released under the MIT License.