447. Number of Boomerangs

题目摘要
给定平面上的n个点，一个”boomerangs”值三个点(i, j, k)，i到j的距离和i到k的距离相等，找到boomerangs的数量。

解法
遍历二元数组n，每次循环，将改点与其它点的<距离, 该距离点数量>存到一个hashmap里，每次循环boomerangs的数量为map的每个value * (value - 1)相加

public class Solution {
    public int numberOfBoomerangs(int[][] points) {
        if (points == null || points.length == 0)
            return 0;
        int result = 0;
        Map<Integer, Integer> map= new HashMap<>();
        for (int i = 0; i < points.length; i++) {
            for (int j = 0; j < points.length; j++) {
                int range = getBoomeranges(points[i], points[j]);
                map.put(range, map.getOrDefault(range, 0) + 1);
            }
            for (int x : map.values()) {
                result += x * (x - 1);
            }
            map.clear();
        }
        return result;
    }
    public int getBoomeranges(int[] a, int[] b) {
        return (a[0] - b[0]) * (a[0] - b[0]) + (a[1] - b[1]) * (a[1] - b[1]);
    }
}

注意
每个距离数量为v, boomerangs的数量为v * (v - 1)

可问问题

原题
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]]

2

Explanation: The two boomerangs are [[1,0],[0,0],[2,0]] and
[[1,0],[2,0],[0,0]]