74 Search a 2D Matrix

1 题目

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

2 尝试解

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

3 标准解

class Solution {
public:
    bool searchMatrix(vector<vector<int> > &matrix, int target) {
        int n = matrix.size();
        int m = matrix[0].size();
        int l = 0, r = m * n - 1;
        while (l != r){
            int mid = (l + r - 1) >> 1;
            if (matrix[mid / m][mid % m] < target)
                l = mid + 1;
            else 
                r = mid;
        }
        return matrix[r / m][r % m] == target;
    }
};