Leetcode 刷题剑指 Offer 04. 二维数组中的查找难度:中等class Solution { public boolean findNumberIn2DArray(int[][] matrix, int target) { int i = matrix.length - 1, j = 0; while(i >= 0 && j <= matrix[0].length -1){ if(matrix[i][j] > target) i--; else if(matrix[i][j] < target) j++; else return true; } return false; }}