LeetCode83|排序矩阵查找

示例:

现有矩阵 matrix 如下：

[
  [1,   4,  7, 11, 15],
  [2,   5,  8, 12, 19],
  [3,   6,  9, 16, 22],
  [10, 13, 14, 17, 24],
  [18, 21, 23, 26, 30]
]
给定 target = 5，返回 true。

给定 target = 20，返回 false。

public class SearchMatrixTest2 {
    public static void main(String[] args) {
        int[][] matrix = {
                {1, 4, 7, 11, 15},
                {2, 5, 8, 12, 19},
                {3, 6, 9, 16, 22},
                {10, 13, 14, 17, 24},
                {18, 21, 23, 26, 30}
        };
        int target = 5;
        boolean searchMatrix = searchMatrix(matrix, target);
        System.out.println("searchMatrix = " + searchMatrix);
    }

    public static boolean searchMatrix(int[][] matrix, int target) {
        if (matrix == null || matrix.length == 0 || matrix[0].length == 0) {
            return false;
        }
        int rowLength = 0;
        int colLength = matrix[0].length - 1;
        while (rowLength < matrix.length && colLength >= 0) {
            if (matrix[rowLength][colLength] == target) {
                return true;
            } else if (matrix[rowLength][colLength] > target) {
                colLength--;
            } else {
                rowLength++;
            }
        }
        return false;
    }
}