35. 搜索插入位置

int searchInsert(int* nums, int numsSize, int target){
if(numsSize ==1){
    if(target<=nums[0])
        return 0;
    return 1;
}
int left=0 , right= numsSize,mid =numsSize/2;
while(right-left>1){
    if(target>=nums[mid])
        left = mid;
    else right = mid;
    mid=(left + right )/2;
}
if(target> nums[left])
    return right;
else return left;
}