LeetCode | 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.

这首题就纯用来练二分查找了。二分查找有时也可能会写错。注意保持区间一致。我习惯于区间左闭右闭。

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