[LeetCode] 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

直接从左下角开始直接搜：

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

        int i = n-1,j = 0;
        while(i >=0 && j < m)
        {
            if(matrix[i][j] == target)
                    return true;
                else if(matrix[i][j] < target)
                {
                    j++;
                }
                else if(matrix[i][j] > target)
                {
                    i--;
                }
        }        
            
        return false;
    }
};

把二维数组转变为一维数组，使用二分法

class Solution {
public:
    bool searchMatrix(vector<vector<int>>& matrix, int target) {
        if(matrix.empty()) return false;
        int m = matrix.size();
        int n = matrix[0].size();
        int left = 0, right = m*n -1;
        int midindex,mid;
        while(left <= right)
        {
            midindex = (left + right)/2;
            mid = matrix[midindex / n][midindex % n];
            if(mid == target)
                return true;
            else if(mid < target)
                left = midindex + 1;
            else if(mid > target)
                right = midindex - 1;
        }

        return false;
    }
};