给定如下的n*n的数字矩阵，每行从左到右是严格递增， 每列的

package Interview;

import java.util.Scanner;

public class FindKinAMatrix {
    public static void main(String[] args) {
        int[][] myArr = inputMatrix();
        System.out.println(find(5, myArr));
    }

    static boolean find(int k, int[][] arr) {
        // 以矩阵的最左下角的元素为基准，若k大于基准值，则往右边走，若k小于基准值，则往上边走
        // 先求出矩阵的大小
        int row = arr.length;
        int row_pivot = row - 1;
        int column_pivot = 0;
        // 则基准数值为arr[row_pivot][column_pivot]
        boolean flag = true; //表示在矩阵中没有找到k
        while (flag && (row_pivot >= 0) && (column_pivot < row)) {
            if (k > arr[row_pivot][column_pivot]) {
                column_pivot++;
            } else if (k < arr[row_pivot][column_pivot]) {
                row_pivot--;
            } else {
                flag = false; // 表示找到了k，退出循环
                //System.out.print("k的行数为"+(row_pivot+1)+",列数为"+(column_pivot+1));
                break;
            }
        }
        return (!flag);
    }

    static int[][] inputMatrix() {
        // 输入矩阵
        Scanner sc = new Scanner(System.in);
        // 输入第一行数据
        String[] firstline = sc.nextLine().split(" ");
        // 判断矩阵的大小
        int n = firstline.length;
        // 创建一个二位数组，存储输入的数据
        int[][] arr = new int[n][n];
        for (int i = 0; i < n; i++) {
            arr[0][i] = Integer.valueOf(firstline[i]);
        }
        // 矩阵的第一行数据存储完毕
        // 现在输入矩阵的其他行数据
        for (int i = 1; i < n; i++) {
            String[] inputStr = (new Scanner(System.in)).nextLine().split(" ");
            for (int j = 0; j < n; j++) {
                arr[i][j] = Integer.valueOf(inputStr[j]);
            }
        }
        return arr;
    }
}

public class test{
    int[] arr;
    private boolean find(int target,int capacity){
         arr = new int[capacity * capacity];
         for( int n = 0 ; n < capacity ; n ++ )
                arr[n] = n + 1;

            return findImpl(arr,target);
          
    }
   //二分查找
    private boolean findImpl(int[] arr,int target){
            int higth = arr.length;
            int low = 0;              int mid = (higth + low)/2
            while(low < higth){
                if(arr[mid] > target){
                    low = mid + 1;
                }

                if(arr[mid] < target){
                    rigth = mid - 1;
                }
                
                if(arr[mid] == target)
                    return true;                

                mid = (higth + low)/2
            }

            return false;
    }

    public stati void main(String[] args){
        int num = 0;
        int capacity = 0;
        Scanner in = new Scanner(System.in);
        System.out.println("输入目标数值:");
        num = in.nextInt();
    System.out.println("输入容量:");
capacity = in,nextInt();



System.out.println(find(num,capacity));

}


}

public class Test5 {     public static void main(String[] args) {         int[][] data = {{1,2,3,4,5},                         {2,3,4,5,6},                         {4,6,7,9,11},                         {6,7,11,12,14},                         {8,10,12,13,15}};         int number = 16;         searchKey(data, number);     }          private static void searchKey(int[][] arr,int number) {         int m = arr.length;         int n = arr[0].length;         for(int i=m-1,j=0;i>=0 && j<n;) {             if(arr[i][j] == number) {                 System.out.println(true);                 return;             }else if(arr[i][j] < number) {                 j++;             }else {                 i--;             }         }         System.out.println(false);     }
}