74. 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.
Example 1
Input:
matrix = [
[1, 3, 5, 7],
[10, 11, 16, 20],
[23, 30, 34, 50]
]
target = 3
Output: true
Example 2:
Input:
matrix = [
[1, 3, 5, 7],
[10, 11, 16, 20],
[23, 30, 34, 50]
]
target = 13
Output: false

给定一个二维数组，数组中每行中的整数从左到右排序。每行的第一个整数大于前一行的最后一个整数。判断数组中是否存在指定数字。

思路：
二分查找：
start =0；
end =rows*cols-1;

关键点：
当前数字的得出 ：matrix[mid/cols][mid%cols] ，对应数字的行和列。

class Solution {
    public boolean searchMatrix(int[][] matrix, int target) {
        if(matrix == null || matrix.length == 0) return false;
        int rows = matrix.length;
        if (matrix[0] == null || matrix[0].length == 0) return false;
        int cols = matrix[0].length;

        int start = 0, end = rows * cols -1;
        while(start + 1 < end){
            int mid = start + (end - start )/ 2;
            if(matrix[mid/cols][mid%cols] < target){
                start = mid;   
            }
            else {
                end = mid;
                 }
            }
        // double check
        if(matrix[start/cols][start%cols] == target) return true;
         if(matrix[end/cols][end%cols] == target) return true;
        return false;
    }
    }