class Solution {
private int getGcd(int x, int y) {
if (y == 0) {
return x;
} else {
return getGcd(y, x % y);
}
}
public int maxPoints(int[][] points) {
int n = points.length;
if (n < 3) {
return n;
}
int max = 1;
for (int i = 0; i < n; i++) {
Map<String, Integer> map = new HashMap<>();
for (int j = i + 1; j < n; j++) {
int dy = points[j][1] - points[i][1];
int dx = points[j][0] - points[i][0];
if (dx == 0) {
dy = 1;
} else if (dy == 0) {
dx = 1;
} else {
if (dx < 0) {
dx = -dx;
dy = -dy;
}
int gcd = getGcd(Math.abs(dx), Math.abs(dy));
dx /= gcd;
dy /= gcd;
}
String key = dx + " " + dy;
map.put(key, map.getOrDefault(key, 0) + 1);
}
for (int val : map.values()) {
if (val > max) {
max = val;
}
}
}
return max + 1;
}
}
149. 直线上最多的点数
最新推荐文章于 2024-09-16 20:08:29 发布