35.md

35. Search Insert Position

Description

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

Solution

Solution 1

/**
 * @param {number[]} nums
 * @param {number} target
 * @return {number}
 */
var searchInsert = function(nums, target) {
    "use strict";
    for (let i = 0; i < nums.length; i++) {
        if (nums[i] === target) {
            return i;
        } else if (nums[i] > target) {
            return i;
        }
    }
    return nums.length;
};

Solution 2

/**
 * Solved with binary search algorithm
 * @param {number[]} nums
 * @param {number} target
 * @return {number}
 */
var searchInsert = function(nums, target) {
    "use strict";
    let left = 0, right = nums.length-1;
    while (left <= right) {
        let mid = Math.floor((left + right)/2);
        if (nums[mid] === target) {
            return mid;
        } else if (nums[mid] > target) {
            right = mid-1;
        } else {
            left = mid+1;
        }
    }
    return left;
};