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.
Example 1:

Input:
matrix = [
  [1,   3,  5,  7],
  [10, 11, 16, 20],
  [23, 30, 34, 50]
]
target = 3
Output: true

Example 2:

Input:
matrix = [
  [1,   3,  5,  7],
  [10, 11, 16, 20],
  [23, 30, 34, 50]
]
target = 13
Output: false

方法0: brute force

Time complexity: O(m + n)
Space complexity: O(1)

方法1: binary search (1-d)

grandyang：http://www.cnblogs.com/grandyang/p/4323301.html

思路：

转化成一维向量，关键在于坐标之间的转化。

方法2: binary search (matrix)

思路：

转化成1. “最后一个小于等于”的行首，2. 行内部“等于”。

Complexity

Time complexity: O(logm + logn)
Space complexity: O(1)

// find the last row that [0] is smaller or equal to target
// find the element in that row
// if not found return -1

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