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
此题属于容易题,注意一下边界条件,以及可能引起程序崩溃的地方。比如空数组, 只有一个元素,插入数组首元素钱,最后一个元素后等。C++代码如下:
class Solution {
public:
int searchInsert(int A[], int n, int target) {
int i = 0;
if (n < 0)
return -1;
if (target < A[0] || n== 0)
return 0;
for (; i < n-1; i++)
{
if (target > A[i] && target < A[i + 1])
return i + 1;
else if (target == A[i])
return i;
}
if (target == A[n - 1])
return n - 1;
else
return n;
}
};