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
看清题目,插入位置,不是二分查找
class Solution {
public:
int searchInsert(int A[], int n, int target) {
if( n == 0)
return 0;
return binarySearch( A, target, 0, n-1);
}
int binarySearch( int A[], int target, int left, int right){
if( left > right)
return left;
int mid = ( left + right) >> 1;
if( A[mid] == target)
return mid;
else if( A[mid] > target)
return binarySearch( A, target, left, mid-1);
else
return binarySearch( A, target, mid+1, right);
}
};