classSolution{publicbooleancheck(int[] nums,int target){int l =0;int r = nums.length -1;while(l < r){int mid = l + r >>1;if(nums[mid]>= target) r = mid;else l = mid +1;}return nums[l]== target;}publicbooleanfindNumberIn2DArray(int[][] matrix,int target){int n = matrix.length;if(n ==0)returnfalse;for(int i =0; i < n; i++){if(matrix[i].length ==0)continue;if(check(matrix[i],target))returntrue;}returnfalse;}}