refactor 447

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_447.java

@@ -3,25 +3,6 @@
 import java.util.HashMap;
 import java.util.Map;
 
-/**
- * 447. Number of Boomerangs
- *
- * Given n points in the plane that are all pairwise distinct,
- * a "boomerang" is a tuple of points (i, j, k) such that the distance
- * between i and j equals the distance between i and k (the order of the tuple matters).
- *
- * Find the number of boomerangs.
- * You may assume that n will be at most 500 and coordinates of points are all in the range [-10000, 10000] (inclusive).
-
- Example:
- Input:
- [[0,0],[1,0],[2,0]]
-
- Output:
- 2
-
- Explanation:
- The two boomerangs are [[1,0],[0,0],[2,0]] and [[1,0],[2,0],[0,0]]*/
 public class _447 {
 
     public static class Solution1 {