LeetCode BinarySearch 74 Search a 2D Matrix

74. Search a 2D Matrix

Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:

Integers in each row are sorted from left to right.
The first integer of each row is greater than the last integer of the previous row.
Example 1:
Input:
matrix = [
[1, 3, 5, 7],
[10, 11, 16, 20],
[23, 30, 34, 50]
]
target = 3
Output: true

Example 2:
Input:
matrix = [
[1, 3, 5, 7],
[10, 11, 16, 20],
[23, 30, 34, 50]
]
target = 13
Output: false

solution 1

最直接的方法：把二维数组看作一个一维数组进行search，进行一下index转换就可以。时间复杂度为$O(log(mn))$

    public boolean searchMatrix(int[][] matrix, int target) {
        if (matrix == null || matrix.length == 0 ||matrix[0].length == 0) return false;
        int m = matrix.length;
        int n = matrix[0].length;
        int lo = 0;
        int hi = m * n - 1;
        while (lo + 1 < hi) {
            int mid = lo + (hi - lo) / 2;
            int r = mid / n;
            int col = mid % n;
            if (matrix[r][col] > target) {
                hi = mid;
            } else if (matrix[r][col] < target) {
                lo = mid;
            } else if (matrix[r][col] == target) {
                return true;
            }
        }
        
        return (matrix[lo / n][lo % n] == target 
                || matrix [hi / n][hi % n] == target);
    }

solution 2

也可以采用两个binary search，这样时间复杂度为$O(logm+logn)$

    public boolean searchMatrix(int[][] matrix, int target) {
        if (matrix == null || matrix.length == 0 ||matrix[0].length == 0) return false;
        int m = matrix.length;
        int n = matrix[0].length;
        
        int lo = 0;
        int hi = m - 1;
        
        // since the 2D array is sorted in each row,
        // we first search the row
        int row = 0;
        while (lo + 1 < hi) {
            int mid = lo + (hi - lo) / 2; 
            if (matrix[mid][0] > target) {
                hi = mid;
            } else if (matrix[mid][n - 1] < target) {
                lo = mid;
            } else if (matrix[mid][0] <= target && target <= matrix[mid][n - 1]) {
                hi = mid;
            }
        }
        
        if (matrix[lo][0] <= target && target <= matrix[lo][n - 1]) {
            row = lo;
        } else if (matrix[hi][0] <= target && target <= matrix[hi][n - 1]) {
            row = hi;
        } else {
            return false;
        }
        
        
        // search the col
        // we have already found the row num
        // search in the specific row
        lo = 0;
        hi = n - 1;
        while (lo + 1 < hi) {
            int mid = lo + (hi - lo) / 2;
            if (matrix[row][mid] < target) {
                lo = mid;
            } else if (matrix[row][mid] > target) {
                hi = mid;
            } else if (matrix[row][mid] == target) {
                return true;
            }
        }
        
        return (matrix[row][hi] == target || matrix[row][lo] == target);
    }