LeetCode-Hash-447. Number of Boomerangs

问题：https://leetcode.com/problems/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).
分析：在{a,b,c,d,e…}中，如果与a和b之间距离相等的点有k个(包括b)，那在这k点中任意选择两个点就可以组成一个三元组，一共就是k(k-1)中。所以就以每一个点为起点，找跟它距离相等的点，记录这些点的个数，用map记录，key是距离长度，value是距离出现的次数。这样就可以知道一共有多少了。
代码：

class Solution {
public:
    int numberOfBoomerangs(vector<pair<int, int>>& points) {
        int l=points.size();
        unordered_map<int,int> map;
        int result=0;
        for(int i=0;i<l;i++){
            for(int j=0;j<l;j++){
                int xvalue=points[i].first-points[j].first;
                int yvalue=points[i].second-points[j].second;
                map[xvalue*xvalue+yvalue*yvalue]++;
            }
        unordered_map<int,int>::iterator it;
        for(it=map.begin();it!=map.end();it++){
            int tem=it->second;
            result+=tem*(tem-1);
        }
        map.clear();
        }
        return result;
    }
};