将矩阵看作二叉搜索树!!
class Solution {
public boolean searchMatrix(int[][] matrix, int target) {
//将矩阵看作二叉搜索树
int m = matrix.length, n = matrix[0].length;
//从右上角开始搜索(也可以从左下角开始)
int row = 0, col = n-1;
while(row < m && col >= 0){
if(matrix[row][col] == target)
return true;
if(target < matrix[row][col]){
col--;
}
else row++;
}
return false;
}
}