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

思路参考这里

class Solution {
public:
    int numberOfBoomerangs(vector<vector<int>>& points) {
        int len=points.size(),i,j,xx,yy,ans=0;
        map<int,int>mp;
        for(i=0;i<len;i++){            
            for(j=0;j<len;j++){
                if(i==j)continue;
                xx=points[i][0]-points[j][0];
                yy=points[i][1]-points[j][1];
                mp[xx*xx+yy*yy]++;
            }
            map<int,int>::iterator it=mp.begin();
            for(;it!=mp.end();it++){
                ans=ans+it->second*(it->second-1);
            }
            mp.clear();
        }
        return ans;
    }
};