LeetCode74 Search a 2D Matrix 矩阵查询 C++

问题描述：
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

题源：here；完整实现：here
思路：
同一维情况，只是我们在这里将mid的值转换为矩阵的行列坐标，代码如下：

    bool searchMatrix(vector<vector<int>>& matrix, int target) {
        if (matrix.size() <= 0) return false;
        int left = 0, right = matrix.size()*matrix[0].size() - 1;
        while (left <= right){
            int mid = (left + right) / 2;
            int rowIdx = mid / matrix[0].size(), colIdx = mid % matrix[0].size();
            if (matrix[rowIdx][colIdx] == target) return true;
            else if (matrix[rowIdx][colIdx] < target) left = mid + 1;
            else right = mid - 1;
        }

        return false;
    }