[leetcode]Search Insert Position

暴力可以直接水过。

用二分可以过。注意的是插入的点可能不在数组中。

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