240. 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(nlogm)的算法(和上一题一样)，讨论区里有人用了O(m + n)的算法，真的很神奇

O(nlogm)：

bool searchMatrix(int** matrix, int matrixRowSize, int matrixColSize, int target) {
    int n = matrixRowSize, m = matrixColSize;
    for(int i = 0; i < n; i++)
    {
        int l = 0, r = m - 1, mid;
        while(l <= r)
        {
            mid = (l + r) / 2;
            if(matrix[i][mid] == target)
                return true;
            if(matrix[i][mid] > target)
                r = mid - 1;
            else
                l = mid + 1;
        }
    }
    return false;
}

O(m + n)：

bool searchMatrix(int** matrix, int matrixRowSize, int matrixColSize, int target) {
    int i = 0, j = matrixColSize - 1;
    while(i < matrixRowSize && j >= 0)
    {
        if(matrix[i][j] == target)
            return true;
        if(matrix[i][j] > target)
            j--;
        else
            i++;
    }
    return false;
}