leetcode编程记录20 #74 Search a 2D Matrix

leetcode编程记录20 #74 Search a 2D Matrix

标签（空格分隔）： leetcode

---

这次是一道比较简单的查询的题目，只要将搜索的2d矩阵转换成一个一维的数组进行搜索即可。
题目如下：
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.
For example,

Consider the following matrix:

[
[1, 3, 5, 7],
[10, 11, 16, 20],
[23, 30, 34, 50]
]
Given target = 3, return true.

题目分析与理解:这道题目要求我们搜索一个从左至右和从上至下依次有序的一个2d矩阵，这里所说的从左至右是对于每一行来说的，而从上之下则是从上一行最末到下一行最始也是依次增长的，因此我们可以将这个矩阵视作是一个从序号0开始到序号为n*m-1的升序的一维数组，然后采用二分查找来对数组中的元素进行搜索。

代码如下：

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