public class Solution {
public boolean searchMatrix(int[][] matrix, int target) {
if (matrix == null || matrix.length < 1 || matrix[0].length < 1) {
return false;
}
int row = matrix.length;
int col = matrix[0].length;
int start = 0;
int end = row * col - 1;
while (start <= end) {
int mid = start + (end - start) / 2;
int r = mid / col;
int c = mid % col;
if (matrix[r][c] == target) {
return true;
} else if (matrix[r][c] < target) {
start = mid + 1;
} else {
end = mid - 1;
}
}
return false;
}
}
Search a 2D Matrix
最新推荐文章于 2022-06-15 11:43:15 发布