LintCode Search a 2D matrix 搜索二维矩阵

写出一个高效的算法来搜索 m × n矩阵中的值。
这个矩阵具有以下特性：
每行中的整数从左到右是排序的。
每行的第一个数大于上一行的最后一个整数。

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.

样例
考虑下列矩阵：
[
[1, 3, 5, 7],
[10, 11, 16, 20],
[23, 30, 34, 50]
]
给出 target = 3，返回 true

挑战
O(log(n) + log(m)) 时间复杂度

解法：
对第0列使用二分查找（O(log(m))），找到元素可能在的行。再在该行使用二分查找(O(log(n)))。

public class Solution {
    /**
     * @param matrix, a list of lists of integers
     * @param target, an integer
     * @return a boolean, indicate whether matrix contains target
     */
    public boolean searchMatrix(int[][] matrix, int target) {
        if(null == matrix || matrix.length == 0 || matrix[0].length == 0) return false;
        int low = 0, high = matrix.length - 1;
        while(low <= high) {
            int mid = low + (high - low) / 2;
            if(matrix[mid][0] == target) return true;
            else if(matrix[mid][0] < target) low = mid + 1;
            else high = mid - 1;
        }
        if(high < 0)return false;
        int row = high;
        low = 0;
        high = matrix[row].length - 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;
        }
        return false;
    }
}