Divide and Conquer -- Leetcode problem240. Search a 2D Matrix II

• 描述：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.
For example,

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在不在m*n数组中，如果在返回true，否则返回false。
• 思路一：直接使用for循环解答，无技术可言。

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

• 思路二：由于数组中的元素行和列严格按照升序排序，依据这一特性我们从第一行最后一列来进行寻找，可以分为以下几种情况：
  1.相等，即找到target（return true）
  2.target小于该点的值，根据排列规则target只会在上方或者左方，由于从matix[0][width]寻找，因此只用考虑左面，即width–
  3.target大于该点的值，根据排列规则target只会在下方或者右方，由于从matix[0][width]寻找，因此只用考虑下方，即height++
  4.下标越界，即没找到（return false）

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