LeeCode 搜索插入位置 （复习了下二分法）

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