leetcode 35. 搜索插入位置（C语言）（二分查找）

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

    return ans;
}