35. 搜索插入位置C

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

结果：