问题描述:
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).
分析:
遍历所有点,找到其余点与当前点的距离,将其存储在map的查找表中,这样既可以记录距离,也可以记录频次。对于当前点,每个距离值存在的组合数为n*(n-1),其中n为频次,不断叠加,遍历完整个点集后,既找到了最终的结果
代码:
class Solution {
public:
int numberOfBoomerangs(vector<pair<int, int>>& points) {
int res=0;
for(int i = 0; i < points.size(); i++){
unordered_map<int,int> record;
for(int j =0; j< points.size(); j++){
if(i != j){
record[dis(points[i],points[j])]++;
}
}
for(unordered_map<int,int>::iterator iter = record.begin();
iter != record.end(); iter++){
res += iter->second * (iter->second -1);
}
}
return res;
}
private:
int dis(pair<int,int> &pa, pair<int,int> &pb){
return (pa.first - pb.first)*(pa.first - pb.first)
+(pa.second - pb.second)*(pa.second - pb.second);
}
};