35. Search Insert Position

/*
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不存在与数组中时，以left索引来标注该值在数组中的排序索引。
*/
int searchInsert(int* nums, int numsSize, int target)
{
int left=0,right=numsSize-1,mid=0;
while(left<=right)
{
mid=(left+right)>>1;
if(nums[mid]==target) return mid;
else if(nums[mid]>target) right=mid-1;
else left=mid+1;
}
return left;
}