class Solution {
public int numberOfBoomerangs(int[][] points) {
int len=points.length;
int res=0;
for(int i=0;i<len;i++){
HashMap<Double,Integer> map=new HashMap<>();
int[] a=points[i];
for(int j=0;j<len;j++){
int[] b=points[j];
double distance=getDis(a,b);
map.put(distance,map.getOrDefault(distance,0)+1);
}
for (Map.Entry<Double, Integer> entry : map.entrySet()) {
int n=entry.getValue();
res+=(n*(n-1));
}
}
return res;
}
public double getDis(int[] a,int[] b){
return Math.sqrt((a[0]-b[0])*(a[0]-b[0])+(a[1]-b[1])*(a[1]-b[1]));
}
}