二分法查询

 public int binaryFun(int[] a, int num) {
        int right, left, middle;
        left = 0;
        right = a.length - 1;
        while (left <= right) {
            middle = (right + left) >> 1;
            System.out.println(middle);
            if (a[middle] == num) {
                return middle;
            } else if (a[middle] < num) {
                left = middle + 1;
            } else {
                right = middle - 1;
            }
        }
        return -1;
    }

用二分法查找对排序好的数组查找num数组下标，如果没找到则返回-1.