Leetcode-JavaScript/Search Insert Position.js at master · parshva45/Leetcode-JavaScript · GitHub

41 lines (33 loc) · 790 Bytes

/*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 1:

Input: [1,3,5,6], 0

Output: 0*/

/**

* @param {number[]} nums

* @param {number} target

* @return {number}

var searchInsert = function(nums, target) {

start = 0

end = nums.length-1

while(start <= end){

mid = Math.floor((start + end)/2)

if(nums[mid] == target)

return mid

else if(nums[mid] < target)

start = mid + 1

else

end = mid - 1

}

return start

};

Leetcode-JavaScript/Search Insert Position.js at master · parshva45/Leetcode-JavaScript · GitHub

Expand file tree

Breadcrumbs

Search Insert Position.js

Latest commit

History

Breadcrumbs

Search Insert Position.js

File metadata and controls