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.

这是一个二分查询的问题，先二分查找定位到某一行，然后在改行再次用二分查找找到target。时间复杂度是（logm + logn）,空间复杂度是O(1);
 

public class Solution {
    public boolean searchMatrix(int[][] matrix, int target) {
        if (matrix == null || matrix.length == 0 || matrix[0].length == 0)
            return false;
        int left = 0;
        int right = matrix.length-1;
        while(left <= right){
            int mid = (left + right)/2;
            if(matrix[mid][0] == target) return true;
            if(matrix[mid][0] > target){
                right = mid-1;
            }else{
                left = mid + 1;
            }
        }
        int row = right;
        if(row < 0)
            return false;
        left = 0;
        right = matrix[0].length - 1;
        while(left <= right){
            int mid = (left + right)/2;
            if(matrix[row][mid] == target) return true;
            if(matrix[row][mid] > target){
                right = mid-1;
            }else{
                left = mid + 1;
            }
        }
        return false;
    }
    
}