[leetcode-34]Search Insert Position(c)

问题描述：

Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.

You may assume no duplicates in the array.

Here are few examples.

[1,3,5,6], 5 → 2

[1,3,5,6], 2 → 1

[1,3,5,6], 7 → 4

[1,3,5,6], 0 → 0

分析如下：还是采用二分查找，如果找到target，直接返回索引，如果大于target，再查看在它左边的数，如果左边小于target，那么返回mid；这样，除非数组中的数不小于target，那么肯定可以返回；如果全小于target，直接返回numsSize;

代码如下：4ms

[code]int searchInsert(int* nums, int numsSize, int target) {
    int left = 0;
    int right = numsSize-1;
    int mid;

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