/***************** Using BinarySearch to speed up *********************/
import java.io.*;
import java.util.*;
public class Main
{
private int search0(int[] array, int target)
{
if (array.length == 0)
{
return 0;
}
int lo = 0, hi = array.length;
while (lo < hi)
{
int mid = lo + (hi - lo) / 2;
if (array[mid] >= target)
{
hi = mid;
}
else // array[mid] < target
{
lo = mid +1;
}
}
return lo;
}
private int search1(int[
[Java] 202012-2 期末预测之最佳阈值
最新推荐文章于 2022-03-13 15:40:02 发布