class Solution {
// 从右上开始找,空间O(1),时间最多循环O(m+n)次
public boolean findNumberIn2DArray(int[][] matrix, int target) {
if(matrix==null||matrix.length==0||matrix[0].length==0 ){
return false;
}
int rows=matrix.length-1;
int row=0,column=matrix[0].length-1;
while(row<=rows&&column>=0){
if(matrix[row][column]==target){
return true;
}else if(matrix[row][column]<target){
row++;
}else{
column--;
}
}
return false;
}
}