编辑代码

public class fhj {
    public static void main(String[] args) {
        int[] array = {85, 63, 52, 34, 25, 17, 6};
        int key = 15;
        boolean flag = searchByInt(array, key);
        System.out.println(flag ? "数组中存在 " + key : "数组中不存在 " + key);
        key = 34;
        flag = searchByInt(array, key);
        System.out.println(flag ? "数组中存在 " + key : "数组中不存在 " + key);
        key = 6;
        flag = searchByInt(array, key);
        System.out.println(flag ? "数组中存在 " + key : "数组中不存在 " + key);
    }
    
    public static boolean searchByInt(int[] array, int key) {
        int low = 0;
        int high = array.length - 1;
        
        while (low <= high) {
            int mid = low + (high - low) / 2;
            if (key == array[mid]) {
                return true;
            } else if (key > array[mid]) {
                high = mid - 1;
            } else {
                low = mid + 1;
            }
        }
        return false;
    }
}