算法与数据结构——二分查找法（2）

public class BinarySearch {

    private BinarySearch(){}

    public static <E extends Comparable<E>> int search(E[] arr,E target){
        int l = 0,r = arr.length;
        //在 arr[l,r)中查找 target,前闭后开
        while(l < r){
            int mid = l + (r - l)/2;
            if(arr[mid].compareTo(target) == 0){
                return mid;
            }
            if(arr[mid].compareTo(target) <= 0){
                l = mid + 1;
            }else{
                r = mid;
            }
        }
        return -1;
    }

    // > target 最小值索引
    public static <E extends Comparable<E>> int upper(E[] arr,E target){
        int l = 0,r = arr.length;
        //在 arr[l,r]中查找 target
        while(l < r){
            int mid = l + (r - l)/2;
            if(arr[mid].compareTo(target) <= 0){
                l = mid + 1;
            }else{
                r = mid;
            }
        }
        return l;
    }

    // 大于 target 返回最小值索引
    // 等于 target 返回最大值索引
    public static <E extends Comparable<E>> int ceil(E[] arr,E target){
        int u = upper(arr, target);
        if(u-1>= 0 && arr[u-1].compareTo(target) == 0){
            return u-1;
        }else{
            return u;
        }
    }

    // 小于 target 的最大值索引(该方法容易死循环,原因相邻两个值一样)
    public static <E extends Comparable<E>> int lower(E[] arr,E target){
        int l = -1,r = arr.length - 1;
        // 在 arr[l,r] 中寻找解
        while(l < r){
            int mid = l + (r - l)/2;
            System.out.println(l + " " + r);
            if(arr[mid].compareTo(target) < 0){
                l = mid;
            }else{
                r = mid - 1;
            }
        }
        return l;
    }

    // 小于 target 的最大值索引(mid 取值多取一位)
    public static <E extends Comparable<E>> int lowerInfo(E[] arr,E target){
        int l = -1,r = arr.length - 1;
        // 在 arr[l,r] 中寻找解
        while(l < r){
            int mid = l + (r - l + 1)/2;
            System.out.println(l + " " + r);
            if(arr[mid].compareTo(target) < 0){
                l = mid;
            }else{
                r = mid - 1;
            }
        }
        return l;
    }

    public static void main(String[] args) {
//        Integer[] arr = {12,34,56,33,88,99};
//        int index = BinarySearch2.upper(arr, 10);
//        System.out.println(index);
        Integer[] arr = {1,1,3,3,5,5};
        for (int i = 0; i <= 6; i++) {
            System.out.print(BinarySearch2.lower(arr,i) + " ");
        }
        System.out.println();
    }
}