240.搜索二维矩阵Ⅱ

先对行进行遍历，再对列进行二分遍历

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