public class Solution {
public boolean Find(int target, int [][] array) {
if(array==null) {
return false;
}
int x=0;
int y=array[0].length;
while(x<array.length&&y>0) {
if(array[x][y-1]<target) {
x++;
}
else if(array[x][y-1]>target) {
y--;
}
else {
return true;
}
}
return false;
}
}