剑指offer java no.04
NO.04: 在一个二维数组中,每一行都按照从左到右递增的顺序排序,每一列都按照从上到下递增的顺序排序。完成一个函数,输入这样的一个二维数组和一个整数,判断数组中是否含有该数。 public class NO04 { public static void main(String[] args) { int [][] matrix = {{1,2,8,9}, {2,4,9,12}, {4,7,10,13}, {6,8,11,15}}; int rows = 4; int columns = 4; int number = 6; NO04A no04A = new NO04A(); System.out.println( no04A.find(matrix, rows, columns, number)); } } class NO04A{ boolean find(int[][] matrix, int rows, int columns, int number){ boolean found = false; if (matrix != null && rows > 0 && columns > 0) { int row = 0; int column = columns - 1; while (row < rows && column >= 0) { if (matrix[row