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.

For example,

Consider the following matrix:

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

Given target = 3, return true.
有两种解法，第一种方法同一维数组解法，即中值法，时间复杂度O(log(m*n))

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

第二方法，设当前搜索点为matrix[x][y]，初始搜索点设置在matrix[m-1][0]处，如果target比matrix[x][y]小，则执行x--；如果target比matrix[x][y]大，则执行y++.算法时间复杂度为O(m+n)

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