We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent f50487f commit ffed864Copy full SHA for ffed864
src/main/java/com/fishercoder/solutions/_149.java
@@ -51,7 +51,8 @@ public int maxPoints(Point[] points) {
51
int result = 0;
52
for (int i = 0; i < points.length; i++) {
53
map.clear();
54
- int overlap = 0, max = 0;
+ int overlap = 0;
55
+ int max = 0;
56
for (int j = i + 1; j < points.length; j++) {
57
int x = points[j].x - points[i].x;
58
int y = points[j].y - points[i].y;
@@ -84,7 +85,6 @@ public int maxPoints(Point[] points) {
84
85
}
86
87
private int generateGCD(int a, int b) {
-
88
if (b == 0) {
89
return a;
90
} else {
0 commit comments