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

代码如下，思路见具体的注释。

bool searchMatrix(vector<vector<int> > &matrix, int target) {
// Use two binary search to find the target:
// 1) First, find the row which the target is in;
// 2) Second, find the target in the row.

        int top = 0, bottom = matrix.size()-1; // top row and bottom row
        int mid; // the row which the target is in.
        while(top<=bottom)
        {
                mid = top+(bottom-top)/2;
                if(matrix[mid][0]>target)
                        bottom = mid-1;
                else if(matrix[mid].back()<target)
                        top = mid+1;
                else
                        break;
        }

        if(top>bottom)
                return false;

        // Find the target in the mid-th row.
        int left = 0, right = matrix[mid].size()-1;
        while(left<=right)
        {
                int mid_ = left+(right-left)/2;
                if(matrix[mid][mid_] == target)
                        return true;
                if (matrix[mid][mid_]>target)
                        right = mid_ - 1;
                else if(matrix[mid][mid_]<target)
                        left = mid_+1;
        }

        return false;
}