Algorithm


Problem - Search Insert Position

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

Level - Beginner


Details:

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

 

Code Examples

#1 Code Example with Javascript Programming

Code - Javascript Programming


var searchInsert = function(nums, target) {
    for (let i = 0; i < nums.length; i++) {
        const num = nums[i];

        if (num == target || num > target) {
          return parseInt(i);
        } else if (typeof nums[i + 1] !== "undefined" && nums[i + 1] > target) {
          return parseInt(i + 1);
        }
      }

      return nums.length;
};
Copy The Code & Try With Live Editor

Input

x
+
cmd
[1,3,5,6]
2

Output

x
+
cmd
1

Demonstration


Leetcode - Search Insert Position Problem Solution in Javascript Leetcode