35. Search Insert Position（js）

35. Search Insert Position

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 4:

Input: [1,3,5,6], 0
Output: 0
题意：向有序数字数组中插入一个数字，使得插入后的数组任然有序，返回插入索引
代码如下：

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