LeetCode算法系列：74. 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

算法实现：

比较简单，本质上是采用二分法，只不过要把中间处的索引，换算成matrix中的第几行和第几列

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 i = 0, j = m*n - 1;
        int suanz, row, col;
        while(i <= j){
            suanz = (i + j)/2;
            row = suanz/n;
            col = suanz%n;
            if(matrix[row][col] == target)return true;
            else if(matrix[row][col] > target)j = suanz - 1;
            else i = suanz + 1;
        }
        
        return false;
    }
};