Last updated: Nov 27, 2022
Difficulty : easy
Runtime : 74 ms Faster than 80.53 %
Memory : 42.2 mb Lesser than 47.36 %

# 35. Search Insert Position

Given a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.

You must write an algorithm with O(log n) runtime complexity.

Example 1: Input: nums = [1,3,5,6], target = 5 Output: 2

Example 2: Input: nums = [1,3,5,6], target = 2 Output: 1

Example 3: Input: nums = [1,3,5,6], target = 7 Output: 4

Constraints:

• 1 <= nums.length <= 104
• -104 <= nums[i] <= 104
• nums contains distinct values sorted in ascending order.
• -104 <= target <= 104

## Solution:

``````/**
* @param {number[]} nums
* @param {number} target
* @return {number}
*/
var searchInsert = function(nums, target) {
var len = nums.length
var l = 0
var r = len - 1

if(!len) return 0

var mid = 0

while(l <= r) {
mid = Math.floor((r + l) / 2)
if(nums[mid] < target) l = mid + 1
else if (nums[mid] > target) r = mid - 1
else return mid
}

return target < nums[mid] ? mid : mid + 1
};
``````