leetcode-447-回旋镖的数量
class Solution {
public:
int helper(vector<int> pointA, vector<int> pointB) {
return pow((pointA[0] - pointB[0]), 2) + pow((pointA[1] - pointB[1]), 2);
}
int numberOfBoomerangs(vector<vector<int>>& points) {
unordered_map<int, int> distance;
int N = points.size(), res = 0;
for (int i = 0; i < N; i++) {
distance.clear();
for (int j = 0; j < N; j++) {
res += 2 * ((++distance[helper(points[i], points[j])]) - 1);
}
}
return res;
}
};
int main() {
Solution sol;
vector<vector<int>> input;
input = { {0,0}, {1,0}, {2,0} };
cout << sol.numberOfBoomerangs(input);
cout << endl;
}