LeetCode447 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 NumberBoomerangs {
    public int numberOfBoomerangs(int[][] points) {
        int res = 0;
        for (int i = 0; i < points.length; i++) {
            Map<Integer, Integer> record = new HashMap<>();
            for (int j = 0; j < points.length; j++) {
                if (j !=i){
                    int dis = (points[i][1]-points[j][1])*(points[i][1]-points[j][1])+(points[i][0]-points[j][0])*(points[i][0]-points[j][0]);
                    record.put(dis, record.getOrDefault(dis,0) + 1);
                }
            }
            for ( Integer val: record.values()) {
                if (val >= 2){
                    res += val * (val - 1);
                }
            }
        }
        return res;
    }

    public static void main(String[] args) {
        int[][] points= {{0, 0}, {1, 0}, {2, 0}};
        System.out.println(new NumberBoomerangs().numberOfBoomerangs(points));
    }
}