面试题 10.09. 排序矩阵查找

面试题 10.09. 排序矩阵查找

给定M×N矩阵，每一行、每一列都按升序排列，请编写代码找出某元素。

示例:

现有矩阵 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。

方法1：二分+右上角

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

方法2：二分+左下角

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