/** *在一个二维数组中(每个一维数组的长度相同),每一行都按照从左到右递增的顺序排序,每一列都按照从上到下递增的顺序排序。 * 请完成一个函数,输入这样的一个二维数组和一个整数,判断数组中是否含有该整数。 */ public class P44_FindInArray { public boolean FindInArray(int target,int[][] array) { if (array == null || array.length == 0) { return false; } int Rlength = array.length; int Clength = array[0].length; boolean result = false; for (int i = Rlength - 1; i >= 0;i-- ) { for (int j = 0; j < Clength - 1;j++ ) { if (array[i][j] == target) { result = true; break; } else if (array[i][j] < target) { ; } else if (array[i][j] > target) { ; } } } return result; } public static void main(String[] args){ int[][] array = {{1, 2, 3, 4, 5, 6}, {7, 8, 9, 10, 11, 12}, {13, 14, 15, 16, 17, 18}, {19, 20, 21, 22, 23, 24}}; int target = 13; P44_FindInArray test = new P44_FindInArray(); boolean result = test.FindInArray(target, array); System.out.print(result); } }
剑指offer:二维数组中的查找(java)
最新推荐文章于 2019-12-02 16:27:40 发布