欢迎访问原文所在博客:https://52heartz.top/articles/leetcode-240-search-a-2d-matrix-ii/
解答1[Java]:
class Solution {
public boolean searchMatrix(int[][] matrix, int target) {
if(matrix.length == 0){
return false;
}
int row = 0;
int column = matrix[0].length-1;
while(row<matrix.length&& column>=0){
if(target == matrix[row][column]){
return true;
}
else if(target > matrix[row][column]){
row++;
}
else{
column--;
}
}
return false;
}
}