问题:
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
Binary search的变种。
代码:
class Solution {
public:
int searchInsertHelper(int A[], int start, int end, int target) {
if (start > end) return start;
if (start == end) {
if (A[start] >= target) return start;
else return start + 1;
}
int mid = start + (end - start) / 2;
if (A[mid] == target) return mid;
else if (A[mid] > target && A[mid - 1] < target) {
return mid;
}
else if (A[mid] > target) {
return searchInsertHelper(A, start, mid - 1, target);
}
else {
return searchInsertHelper(A, mid + 1, end, target);
}
}
int searchInsert(int A[], int n, int target) {
return searchInsertHelper(A, 0, n - 1, target);
}
};