Leetcode: Search a 2D Matrix II



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 in ascending from left to right.
• Integers in each column are sorted in ascending from top to bottom.

For example,

Consider the following 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]
]

Given target = 5, return true.

Given target = 20, return false.

最简单的O（m+n）时间复杂度。

class Solution {
public:
    bool searchMatrix(vector<vector<int>>& matrix, int target) {
        if (matrix.empty() || matrix[0].empty()) {
            return false;
        }
        
        int rows = matrix.size();
        int cols = matrix[0].size();
        for (int i = 0, j = cols - 1; i < rows && j >= 0;) {
            if (matrix[i][j] == target) {
                return true;
            }
            else if (matrix[i][j] < target) {
                ++i;
            }
            else {
                --j;
            }
        }
        
        return false;
    }
};

理论上的log时间复杂度，但因为递归，耗时反而长些。

class Solution {
public:
    bool searchMatrix(vector<vector<int>>& matrix, int target) {
        if (matrix.empty() || matrix[0].empty()) {
            return false;
        }

        return searchSubMatrix(matrix, 0, matrix.size() - 1, 0, matrix[0].size() - 1, target);
    }
    
    bool searchSubMatrix(vector<vector<int>>& matrix, int lrow, int urow, int lcol, int ucol, int target) {
        if (lrow > urow || lcol > ucol) {
            return false;
        }
        
        int mrow = (lrow + urow) / 2;
        int mcol = (lcol + ucol) / 2;
        if (matrix[mrow][mcol] == target) {
            return true;
        }
        else if (matrix[mrow][mcol] < target) {
            return searchSubMatrix(matrix, mrow + 1, urow, lcol, ucol, target)
                || searchSubMatrix(matrix, lrow, mrow, mcol + 1, ucol, target);
        }
        else {
            return searchSubMatrix(matrix, lrow, mrow - 1, lcol, ucol, target)
                || searchSubMatrix(matrix, mrow, urow, lcol, mcol - 1, target);
        }
        
        return false;
    }
};