LeetCode-Easy-搜索插入位置（C）

//算法思想:二分查找

int searchInsert(int* nums, int numsSize, int target) {


    int high = numsSize - 1;
    int low = 0;
    int mid=(high + low)/2;

    while(low <= high)
    {
        if(target > nums[high])
        {
            return high + 1;
        }
        else if(target < nums[low])
        {
            return low;
        }
        if(nums[mid] == target)
        {
            return mid;
        }

        if(nums[mid] > target)
        {
            high = mid - 1;
        }
        else
        {
            low = mid + 1;
        }

        mid = (high + low)/2;
    }
    return 1;
}