二分查找
class Solution {
public:
int searchInsert(int A[], int n, int target) {
if(A==nullptr||n==0){
return 0;
}
int left=0,right=n-1,mid=0;
while(left<=right){
int mid=left+(right-left)/2;
if(A[mid]==target){
return mid;
}
if(A[mid]>target){
right=mid-1;
}
if(A[mid]<target){
left=mid+1;
}
}
return left;
}
};