一、二維數(shù)組中的查找

public class FindNumber {
    public static void main(String[] args) {
        int[][] array = {{1, 5, 9, 13}, {2, 6, 10, 14}, {3, 7, 11, 15}, {4, 8, 12, 16}};
        int findNum = 10;
        boolean result = findNumber(array, findNum);
        System.out.println(result);
    }

    public static boolean findNumber(int[][] array, int findNUm){
        int row = 0;
        int line = array[0].length - 1;
        boolean result = false;
        while(true){
            if (array[row][line] == findNUm){
                result = true;
                break;
            }
            if (array[row][line] > findNUm){
                line--;
            }
            if (array[row][line] < findNUm){
                row++;
            }
            if (row > array[0].length - 1 || line < 0){
                break;
            }
        }
        return result;
    }
}