Leetcode•Apr 01, 2025
35. Search Insert Position
Hazrat Ali
Leetcode
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
* Search Insert Position
*
* Given a sorted array 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 may assume no duplicates in the array.
*
* Example 1:
*
* Input: [1,3,5,6], 5
* Output: 2
*
* Example 2:
*
* Input: [1,3,5,6], 2
* Output: 1
*
* Example 3:
*
* Input: [1,3,5,6], 7
* Output: 4
*
* Example 4:
*
* Input: [1,3,5,6], 0
* Output: 0
Solution :
/**
* @param {number[]} nums
* @param {number} target
* @return {number}
*/
const searchInsert = (nums, target) => {
let lo = 0;
let hi = nums.length - 1;
while (lo <= hi) {
const mid = lo + Math.floor((hi - lo) / 2);
if (nums[mid] === target) {
return mid;
}
if (target < nums[mid]) {
hi = mid - 1;
} else {
lo = mid + 1;
}
}
return lo;
};