力扣 74.搜索二维矩阵

题目介绍

题解

代码如下：

class Solution {public boolean searchMatrix(int[][] matrix, int target) {int i = 0, j = matrix[0].length - 1;while(i < matrix.length && j >= 0){if(matrix[i][j] == target){return true;}else if(matrix[i][j] > target){j--;}else{i++;}}return false;}
}