leetcode 35 搜索插入位置

给定一个排序数组和一个目标值，在数组中找到目标值，并返回其索引。如果目标值不存在于数组中，返回它将会被按顺序插入的位置。

你可以假设数组中无重复元素。

示例 1:

输入: [1,3,5,6], 5
输出: 2

示例 2:

输入: [1,3,5,6], 2
输出: 1

示例 3:

输入: [1,3,5,6], 7
输出: 4

示例 4:

输入: [1,3,5,6], 0
输出: 0

 

这个显然要用二分。

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

	return answer;
}

还可以进一步优化：

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

	return left;
}

另外一种写法：

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

        return left;
}