Source: leetcode 35. Search Insert Position
Q. 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.
Here are few examples.[1, 3, 5, 6], 5 → 2[1, 3, 5, 6], 2 → 1[1, 3, 5, 6], 7 → 4[1, 3, 5, 6], 0 → 0
Answer 1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
* @param {number[]} nums
* @param {number} target
* @return {number}
*/
export default function searchInsert (nums, target )
let low = 0
let high = nums.length - 1
while (low <= high) {
const mid = (low + high) / 2 | 0
if (nums[mid] === target) {
return mid
} else if (nums[mid] > target) {
high = mid - 1
} else {
low = mid + 1
}
}
return low
}