#二分查找
//查找该数字的左边界的坐标值
public int findl(int[] arr,int target,int l ,int r){
while (l<r){
int mid = (l+r)/2;
if(arr[mid]>=target) r = mid;
else l = mid+1;
}
return l;
}
//查找该数字的右边界的坐标值
public int findr(int[] arr, int target,int l,int r){
while(l<r){
int mid = (l+r+1)/2;
if(arr[mid]<=target) l = mid;
else r = mid -1;
}
return l;
}