class Solution {
public boolean searchMatrix(int[][] matrix, int target) {
int r = matrix[0].length-1;
for(int i=0;i<matrix.length;i++){
r = binarySearch(matrix,i,r,target);
if(matrix[i][r]==target){
return true;
}
}
return false;
}
public int binarySearch(int[][] matrix,int row,int r,int target){
int l = 0;
while(l<r){
int mid = l+(r-l+1)/2;
if(matrix[row][mid]==target){
return mid;
}else if(matrix[row][mid]>target){
r = mid - 1;
}else{
l = mid;
}
}
return r;
}
}
Hot100-21(Leetcode240)搜索二维矩阵2
最新推荐文章于 2024-06-11 10:43:17 发布