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: 2Example 2:
Input: [1,3,5,6], 2 Output: 1Example 3:
Input: [1,3,5,6], 7 Output: 4Example 4:
Input: [1,3,5,6], 0 Output: 0
/**
* @param {number[]} nums
* @param {number} target
* @return {number}
*/
var searchInsert = function(nums, target) {
if(nums.indexOf(target) != -1){
return nums.indexOf(target);
}
if(nums.length == 0){return 0;}
var len = nums.length;
if(nums[len-1] <= target){
return len;
}
for(let i = 0; i < len ; i++){
if(target < nums[i]){
return i;
}
}
};