classSolution{publicbooleansearchMatrix(int[][] matrix,int target){int m = matrix.length;if(m ==0)returnfalse;int n = matrix[0].length;if(n ==0)returnfalse;int l =0;int r = m * n -1;while(l < r){int mid =(l + r +1)>>1;if(matrix[mid / n][mid % n]> target){
r = mid -1;}else{
l = mid;}}return matrix[l / n][l % n]== target;}}