leetcode 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

给出一个目标值，在矩阵中检索是否有这个元素，有的话返回true，没有返回false

思路：
二维binary search
先在y轴二分搜索，可以和每列第一个元素比，也可以和最后一个元素比，这里和最后一个元素比
这里把最后一列提出来是7，20，50

然后在x轴二分法搜索

不同的是y轴二分法时 while 的条件是left < right,
x轴二分法时 while 的条件是 left <= right，
因为y轴二分搜索是为了锁定target所在行，不需要进一步判断（left == right时没有return跳出）
而x轴二分搜索在left == right仍然需要判断该元素是不是target

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