-
Notifications
You must be signed in to change notification settings - Fork 3
/
149.cpp
55 lines (54 loc) · 1.67 KB
/
149.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
class Solution {
public:
int gcd(int x, int y) {
return y == 0 ? x : gcd(y, x % y);
}
int maxPoints(vector<vector<int>>& points) {
int n = points.size();
int res = 1;
for (int i = 0; i < n; ++i) {
map<pair<int, int>, int> mp;
int duplicate = 1;
for (int j = i + 1; j < n; ++j) {
if (points[j][0] == points[i][0] && points[j][1] == points[i][1]) {
duplicate += 1;
continue;
}
int dx = points[j][0] - points[i][0];
int dy = points[j][1] - points[i][1];
int d = gcd(dx, dy);
mp[make_pair(dy / d, dx / d)]++;
}
res = max(res, duplicate);
for (auto element : mp) {
res = max(res, duplicate + element.second);
}
}
return res;
}
};
class Solution {
public:
int maxPoints(vector<vector<int>>& points) {
int res = 1;
int n = points.size();
for (int i = 0; i < n; ++i) {
int duplicated = 1;
map<pair<int, int>, int> mp;
for (int j = i + 1; j < n; ++j) {
if (points[i] == points[j]) duplicated++;
else {
int dx = points[j][0] - points[i][0];
int dy = points[j][1] - points[i][1];
int gcd = __gcd(dx, dy);
mp[{dx / gcd, dy / gcd}]++;
}
}
res = max(res, duplicated);
for (auto& [p, cnt] : mp) {
res = max(res, duplicated + cnt);
}
}
return res;
}
};