Update Solution.java

javadev · web-flow · commit e06a25ee183b · 2022-03-28T17:04:57.000+03:00
diff --git a/src/main/java/g1401_1500/s1453_maximum_number_of_darts_inside_of_a_circular_dartboard/Solution.java b/src/main/java/g1401_1500/s1453_maximum_number_of_darts_inside_of_a_circular_dartboard/Solution.java
@@ -6,6 +6,7 @@
 import java.util.Collections;
 import java.util.List;
 
+@SuppressWarnings("java:S1210")
 public class Solution {
     private static class Angle implements Comparable<Angle> {
         double a;
@@ -33,7 +34,6 @@ public int compareTo(Angle o) {
 
     private int getPointsInside(int i, double r, int n, int[][] points, double[][] dis) {
         List<Angle> angles = new ArrayList<>(2 * n);
-
         for (int j = 0; j < n; j++) {
             if (i != j && dis[i][j] <= 2 * r) {
                 double b = Math.acos(dis[i][j] / (2 * r));
@@ -47,9 +47,7 @@ private int getPointsInside(int i, double r, int n, int[][] points, double[][] d
                 angles.add(new Angle(beta, false));
             }
         }
-
         Collections.sort(angles);
-
         int count = 1;
         int res = 1;
         for (Angle a : angles) {
@@ -58,17 +56,14 @@ private int getPointsInside(int i, double r, int n, int[][] points, double[][] d
             } else {
                 count--;
             }
-
             if (count > res) {
                 res = count;
             }
         }
-
         return res;
     }
 
     public int numPoints(int[][] points, int r) {
-
         int n = points.length;
         double[][] dis = new double[n][n];
         for (int i = 0; i < n - 1; i++) {
@@ -80,12 +75,10 @@ public int numPoints(int[][] points, int r) {
                                                 + Math.pow(points[i][1] * 1.0 - points[j][1], 2));
             }
         }
-
         int ans = 0;
         for (int i = 0; i < n; i++) {
             ans = Math.max(ans, getPointsInside(i, r, n, points, dis));
         }
-
         return ans;
     }
 }

Original file line number	Diff line number	Diff line change
`@@ -6,6 +6,7 @@`
`6`	`6`	`import java.util.Collections;`
`7`	`7`	`import java.util.List;`
`8`	`8`
	`9`	`+@SuppressWarnings("java:S1210")`
`9`	`10`	`public class Solution {`
`10`	`11`	`private static class Angle implements Comparable<Angle> {`
`11`	`12`	`double a;`
`@@ -33,7 +34,6 @@ public int compareTo(Angle o) {`
`33`	`34`
`34`	`35`	`private int getPointsInside(int i, double r, int n, int[][] points, double[][] dis) {`
`35`	`36`	`List<Angle> angles = new ArrayList<>(2 * n);`
`36`		`-`
`37`	`37`	`for (int j = 0; j < n; j++) {`
`38`	`38`	`if (i != j && dis[i][j] <= 2 * r) {`
`39`	`39`	`double b = Math.acos(dis[i][j] / (2 * r));`
`@@ -47,9 +47,7 @@ private int getPointsInside(int i, double r, int n, int[][] points, double[][] d`
`47`	`47`	`angles.add(new Angle(beta, false));`
`48`	`48`	`}`
`49`	`49`	`}`
`50`		`-`
`51`	`50`	`Collections.sort(angles);`
`52`		`-`
`53`	`51`	`int count = 1;`
`54`	`52`	`int res = 1;`
`55`	`53`	`for (Angle a : angles) {`
`@@ -58,17 +56,14 @@ private int getPointsInside(int i, double r, int n, int[][] points, double[][] d`
`58`	`56`	`} else {`
`59`	`57`	`count--;`
`60`	`58`	`}`
`61`		`-`
`62`	`59`	`if (count > res) {`
`63`	`60`	`res = count;`
`64`	`61`	`}`
`65`	`62`	`}`
`66`		`-`
`67`	`63`	`return res;`
`68`	`64`	`}`
`69`	`65`
`70`	`66`	`public int numPoints(int[][] points, int r) {`
`71`		`-`
`72`	`67`	`int n = points.length;`
`73`	`68`	`double[][] dis = new double[n][n];`
`74`	`69`	`for (int i = 0; i < n - 1; i++) {`
`@@ -80,12 +75,10 @@ public int numPoints(int[][] points, int r) {`
`80`	`75`	`+ Math.pow(points[i][1] * 1.0 - points[j][1], 2));`
`81`	`76`	`}`
`82`	`77`	`}`
`83`		`-`
`84`	`78`	`int ans = 0;`
`85`	`79`	`for (int i = 0; i < n; i++) {`
`86`	`80`	`ans = Math.max(ans, getPointsInside(i, r, n, points, dis));`
`87`	`81`	`}`
`88`		`-`
`89`	`82`	`return ans;`
`90`	`83`	`}`
`91`	`84`	`}`