题目:在一个二维数组中,每一行都按照从左到右递增的顺序排序,每一列都按照从上到下递增的顺序排序,请完成一个函数,输入这样一个数组和一个整数,判断数组中是否含有该整数
public class Find {
public static void main(String[] args) {
int[][] a = new int[][]{
{1,2,8,9},
{2,4,9,12},
{4,7,10,13},
{6,8,11,15}
};
System.out.println(find(a,4));
System.out.println(find(null,4));
System.out.println(find(a,-1));
System.out.println(find(a,6));
}
public static boolean find(int[][] source,int target){
if(source!=null && source.length>0 && source[0].length>0){
int i = 0;
int j = source[0].length -1;
while(i
=0){
if(target==source[i][j])
return true;
else if(target