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
Use the binary search algorithm, set upper and lower bounds as mentioned in 08722 class.
public static int searchInsert(int[] A, int target) {
int lb = 0, ub = A.length-1;
int mid = lb + (ub-lb)/2;
while(lb <= ub){
mid = lb + (ub-lb)/2;
if(A[mid] == target){
return mid;
}else if(target > A[mid]){
lb = mid+1;
}else{
ub = mid-1;
}
}
// 返回下限值,此时刚好为适合插入的位置
return lb;
}