class Solution {
public boolean searchArray(int[][] array, int target) {
if(array==null || array.length==0 || array[0]==null){
return false;
}
int i=0;
int j=array[0].length-1;
while(i[HTML_REMOVED]=0){
if(array[i][j]==target){
return true;
}
if(array[i][j]<target){
i++;
}else{
j–;
}
}
return false;
}
}