力扣35题搜索插入位置 c语言

力扣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+2)/2) + left-1;
            if (target <= nums[mid]) {
                ans = mid;
                right = mid - 1;
            } else {
                left = mid + 1;
            }
        }
        return ans;
    }