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.

思路： 用binary search，将二维拉伸成一维，然后动态算坐标。log(m*n)

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