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.

示例：

Consider the following matrix:

[
  [1,   3,  5,  7],
  [10, 11, 16, 20],
  [23, 30, 34, 50]
]

Given target = 3, return true.

问题分析：

对于查找元素一类问题，首先我们可以考虑利用二分查找法，这个方法有个前提，必须是排好序的序列。刚好此题可以转换为排序好的数组，因此可利用二分查找法求解。

过程详见代码：

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