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.
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.

方法0: brute force

方法1: binary search

思路：

和74题相比，由于每行行首和上一行行尾没有递增关系，必须对所有行首小于等于target的行搜索。转化成1. 查找“最后一个小于等于“的行首，2. 在所有前序行中二分查找“等于”。

Complexity

Time complexity: O(mlogn)
Space complexity: O(1)

class Solution1 {
public:
    //  第一种方法：可以找到最后一个matrix[row][0]<= target, 然后在所有前顺序行中二分搜索
    bool searchMatrix(vector<vector<int>>& matrix, int target) {
        if (matrix.empty() || matrix[0].empty()) return false;
        
        // row
        int left = 0;
        int right = matrix.size() - 1;
        
        while (left + 1 < right ){
            int mid = left + (right - left) / 2;
            if (matrix[mid][0] <= target){
                left = mid;
            }
            else {
                right = mid - 1;
            }
        }
        
        int row = 0;
        if (matrix[right][0] <= target) row = right;
        else if (matrix[left][0] <= target) row = left;
        else return false;
        
        // col
        for (int i = row; i >= 0; i-- ){
            left = 0;
            right = matrix[i].size() - 1;
            
            while (left < right){
                int mid = left + (right - left)/ 2;
                if (matrix[i][mid] == target) return true;
                else if (matrix[i][mid] < target) {
                    left = mid + 1;
                }
                else {
                    right = mid - 1;
                }
            }
            if (matrix[i][left] == target) return true;
        }
        return false;
    }
};

方法2:

思路：

左下角和右上角是两个特殊的位置：matrix[i][j]为轴点蛇形有序，所以比如从左下角开始搜索，每次根据matrix[i][j]的值都可以舍掉一行或一列，如果相等中间可以直接返回true。

易错点

1. 注意查边界

Complexity

Time complexity: O(m + n)
Space complexity: O(1)

//  第二种方法：并不是二分法，用左下或右上数字每次排除一行/一列，直至找到左下/右上==target，否则返回false

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