时间复杂度是O(M+N)
class Solution {
public boolean searchMatrix(int[][] matrix, int target) {
if(matrix.length < 1)
return false;
int m = matrix.length;
int n = matrix[0].length;
int i = 0;
int j = n-1;
while(i >= 0 && i < m && j >= 0 && j < n){
if(matrix[i][j] > target){
j--;
}else if(matrix[i][j] < target){
i++;
}else{
return true;
}
}
return false;
}
}