力扣74.搜索二维矩阵

class Solution {
    public boolean searchMatrix(int[][] matrix, int target) {
        if(matrix == null || matrix.length == 0 || matrix[0].length == 0){
            return false;
        } 
        //所有行进行二分
        int startRow = 0;
        int endRow = matrix.length - 1;
        int endCol = matrix[0].length - 1;
        int row = -1;
        while(startRow + 1 < endRow){
            int mid = startRow + (endRow - startRow)/2;
            if(matrix[mid][endCol] < target){
                startRow = mid;
            }
            else endRow = mid;
        }

        if(matrix[startRow][endCol] >= target) row = startRow;
        else if(matrix[endRow][endCol] >= target) row = endRow;
        else return false;


        //中间行进行二分
        int start = 0;
        int end = endCol;
        while(start + 1 < end){
            int mid = start + (end - start)/2;
            if(matrix[row][mid] < target) start = mid;
            else end = mid;
        }
        if(matrix[row][start] == target || matrix[row][end] == target){
            return true;
        }
        else return false;
    }
}

归纳：先对行进行二分，再对列进行二分。