35. 搜索插入位置

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