447. Number of Boomerangs

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

启发于这个版本点击打开链接，写了个C++版本的

思路：每一个节点都与其他的节点有一定距离，根据距离相同的节点数，计算有多少组。

class Solution {
    int dis(pair<int,int>& a,pair<int,int>& b)
    {
        int x=a.first-b.first;
        int y=a.second-b.second;
        return x*x+y*y;
    }
public:
    int numberOfBoomerangs(vector<pair<int, int>>& points) {
       int n=points.size();
       int cnt=0;
       for(int i=0;i<n;i++)
       {
           map<int,int> mp;//用于统计该节点与其他节点的距离
           pair<int,int> a=points[i];
           for(int j=0;j<n;j++)
           {
               if(j==i) continue;
               pair<int,int> b=points[j];
               int d=dis(a,b);
               mp[d]++;
           }
           for(auto it:mp)
           cnt+=(it.second-1)*it.second;
       }
       return cnt;
    }
};

时间复杂度：O(n^2)  空间复杂度：O(n)