1class Solution {2    public boolean searchMatrix(int[][] matrix, int target) {3        int columns = matrix[0].length;4        int left = 0, right = matrix.length * columns - 1;5        while (left <= right) {6            int mid = left + (right - left) / 2;7            int value = matrix[mid / columns][mid % columns];8            if (value == target) return true;9            if (value < target) left = mid + 1;10            else right = mid - 1;11        }12        return false;13    }14}