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

分析：

给定平面上升n个不同的点，问能组成回旋镖的数量，回旋镖定义为[i , j , k]，其中i点和j的距离等于i点与k的距离。如果有2个点b、c分别和点a距离相等，那么就有两种排列方法abc和acb；如果有三个点b，c，d都分别和a之间的距离相等，那么有六种排列方法，abc, acb, acd, adc, abd, adb，如果有n个点和a距离相等，那么排列方式为n(n-1)。问题就变成了遍历所有点，让每个点都做一次点a，然后遍历其他所有点，统计和a距离相等的点有多少个，别代入n(n-1)计算结果并累加到res中，只有当n大于等于2时，res值才会增加。

class Solution {
public:
    int numberOfBoomerangs(vector<pair<int, int>>& points) {
        int num = 0;
        for(int i = 0; i < points.size(); i++)
        {
            unordered_map<int , int> m ;
            for(int j = 0; j < points.size(); j++)
            {
                int a = points[i].first - points[j].first;
                int b = points[i].second - points[j].second;
                ++m[a*a + b*b];
            }
            for(auto it = m.begin(); it != m.end(); ++it)
                num += it->second * (it->second - 1);
        }
        return num;                                 
    }
};