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.

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

My code:

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

Note: 因?yàn)槭且呀?jīng)排序的數(shù)組，只需要用target與數(shù)組當(dāng)前位比較，如果小于等于當(dāng)前位，則返回當(dāng)前位的下標(biāo)，如果到循環(huán)結(jié)束，還是沒(méi)有，則表明target是最大的，返回?cái)?shù)組最大的下標(biāo)+1即可。