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