【分治算法】Leetcode编程题解：240. Search a 2D Matrix II Add to List

题目：

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 in ascending from left to right.
• Integers in each column are sorted in ascending from top to bottom.

样例：

Consider the following matrix:

[
  [1,   4,  7, 11, 15],
  [2,   5,  8, 12, 19],
  [3,   6,  9, 16, 22],
  [10, 13, 14, 17, 24],
  [18, 21, 23, 26, 30]
]

Given target = 5, return true.

Given target = 20, return false.

这道题可以先对行使用二分搜索，找到首项小于target且末项大于target的行，然后对这一行进行二分搜索，看有没有符合的数，如此递归，知道搜索完成，若还是没有找到，返回false

提交代码：

class Solution {
public:
	bool searchRow(vector<int>& row, int target, int a, int b) {
		int left = a, right = b;
		if(left > right) return false;
		int mid = a + (b - a) / 2;
		if(row[mid] == target) return true;
		if(searchRow(row, target, left, mid - 1)) return true;
		if(searchRow(row, target, mid + 1, right)) return true;
		return false;
	}
	bool searchMatrix(vector<vector<int>>& matrix, int target, int a, int b) {
		int top = a, bottom = b;
		if(top > bottom) return false;
        int mid = top + (bottom - top) / 2;
        if(matrix[mid].front() <= target && target <= matrix[mid].back())
        if(searchRow(matrix[mid], target, 0, matrix[mid].size() - 1)) return true; 
        if(searchMatrix(matrix, target, top, mid - 1)) return true;
        if(searchMatrix(matrix, target, mid + 1, bottom)) return true;
        return false;
	}
    bool searchMatrix(vector<vector<int>>& matrix, int target) {
    	if(matrix.size() == 0) 
    	return false;
    	if(matrix[0].size() == 0)
    	return false;
        return searchMatrix(matrix, target, 0, matrix.size() - 1);
    }
};

这里必须考虑空矩阵的情况，否则会出现引用空指针的错误。

第二种做法是，从右上角开始遍历矩阵，如果比target大，则左移一列，否则下移一行

提交代码：

class Solution {
public:
	bool searchMatrix(vector<vector<int>>& matrix, int target) {
	    if(matrix.size() == 0)
	    return false;
		int i = 0, j = matrix[0].size() - 1;
		while(j >= 0 && i < matrix.size()) {
			if(matrix[i][j] == target) return true;
			if(matrix[i][j] > target) j--;
			else i++;
		}
		return false;
	}
};