35. search insertion position

/* *  Given a sort array and a target value , Find the target value in the array , And return its index . If the target value does not exist in the array , Return to where it will be inserted in sequence . * */
/** * @param {number[]} nums * @param {number} target * @return {number} */
var searchInsert = function(nums, target) {
    
    if(!nums||!nums.length){
    
        return 0;
    }
    var l=0,r=nums.length-1,mid=0;
    while (l<r){
    
        mid=parseInt((l+r)/2);
        if(nums[mid]===target){
    
            return mid;
        }else if(nums[mid]<target){
    
            l=mid+1;
        }else {
    
            r=mid;// If change to r=mid-1, sign out while when , There may be l>r,target Need and nums[l],nums[r] Compare them 
        }
    }
    l=nums[l]<target?l+1:l
    //  Calculation ：nums:[1,3,5,6],target=7 when , Added , sign out while when ,l=r,
    //  So at this time ,nums[l]><=target It's possible , When nums[l]>=target when , Should return to l, Otherwise, we should return to l+1
    return l;
};