该题有点像图里面的广搜
public class Solution {
public boolean Find(int target, int [][] array) {
//从左下角开始遍历
int size=array.length;
int size1=array[0].length;
if(size==0||size1==0)
{
return false;
}
int cen=array[size-1][0];
int a=size-1;
int b=0;
// System.out.println(cen);
while(a>=0&&a<size&&b>=0&&b<size1)
{
cen=array[a][b];
// System.out.println(cen);
if(target>cen)
{
b=b+1;
}
else if(target<cen)
{
a=a-1;
}
else
{
return true;
}
}
return false;
}
}