[刷题]Search Insert Position

public class Solution {
/**
* param A : an integer sorted array
* param target :  an integer to be inserted
* return : an integer
*/
public int searchInsert(int[] A, int target) {
// 2015-4-7 binary search
if (A == null || A.length == 0) {
return 0;
}

int start = 0;
int end = A.length - 1;

while (start + 1 < end) {
int mid = (start + end) / 2;
if (A[mid] >= target) {
end = mid;
} else {
start = mid;
}
}

if (A[start] >= target) {
return start;
} else if (A[end] >= target) {
return end;
} else {
return end + 1;
}
}
}