class Solution {
public boolean searchMatrix(int[][] matrix, int target) {
if(matrix==null)return false;
for (int[] ints : matrix) {
if (Binary(ints, target))
return true;
}
return false;
}
public boolean Binary(int[] ar, int target){
int left = 0;
int right = ar.length-1;
while(left<=right){
int mid = (left+right)/2;
if(ar[mid] == target) return true;
if(ar[mid]>target){
right = mid - 1;
}else{
left = mid +1;
}
}
return false;
}
}
[t74] 矩阵二分水题
最新推荐文章于 2024-06-15 23:36:03 发布