447. 回旋镖的数量
代码:
class Solution {
public int numberOfBoomerangs(int[][] points) {
int count = 0;
for (int i = 0; i < points.length; i++)
{
Map<Integer, Integer> dis = new HashMap<>();
for (int j = 0; j < points.length; j++)
{
if (i == j) continue;
int dist = (points[i][0] - points[j][0]) * (points[i][0] - points[j][0])+ (points[i][1] - points[j][1]) * (points[i][1] - points[j][1]);
if (!dis.containsKey(dist)) dis.put(dist, 1);
else {
count += 2 * dis.get(dist);
dis.put(dist, dis.get(dist) + 1);
}
}
}
return count;
}
}