3.在一个二维数组中,每一行都按照从左到右递增的顺序排序,每一列都按照从上到下递增的顺序排序。请完成一个函数,输入这样的一个二维数组和一个整数,判断数组中是否含有该整数。
思路一:遍历每一行,如果该行最后一个数字大于查询数字,则该用二分法查找
@Test public void test12(){ int[][] array = {{1,2,3,4},{5,6,7,8},{9,10,11,12},{13,14,15,16},{18,19,20,21}}; int length = array.length; int length1 = array[0].length; boolean b = find(array, 20); System.out.println("result="+b); } public boolean find(int[][] array, int target){ if (array == null){ return false; } int row = 0; while(row < array.length){ int column = array[row].length - 1; if (array[row][column] > target){ int i = binaryFind(array[row], target); if (i != -1){ return true; } } row++; } return false; } public int binaryFind(int[] array, int target){ if (array == null || array.length == 0){ return -1; } int start = 0; int end = array.length-1; while (start <= end){ int mid = (start + end)/2; if (array[mid] == target){ return mid; }else if (array[mid] < target){ start = mid+1; }else if (array[mid] > target){ end = mid-1; } } return -1; }