leetcode 数组

在排序数组中找到一个目标值，返回索引，找不到则返回被插入位置的索引

方法一

var searchInsert = function(){
	for(let i=0;i<nums.length;i++){
		if(target < nums[0){
			return 0
		} else if(target <= nums[i){
			return i
		} else if(target>nums[nums.length-1){
			return nums.length
		}
	}
}

方法二

//二分查找法
var searchInsert = function (nums, target) {
    let left = 0;
    let right = nums.length - 1
    let mid;
    while (left <= right) {
        mid = Math.floor((left + right) / 2)
        if (nums[mid] == target) {
            return mid
        } else if (nums[mid] < target) {
            left = mid + 1
        } else if (nums[mid] > target) {
            right = mid - 1
        }
    }
    return left
};