Leetcode 447 Number of Boomerangs
来源:互联网 发布:mac qq 编辑:程序博客网 时间:2024/05/17 08:02
Leetcode 447 Number of Boomerangs
class Solution {public: int numberOfBoomerangs(vector<pair<int, int>>& points) { //找到与每个点距离不同的点有多少个 //若在一组点集{a, b, c, d, ...}中,以点a为一个端点,与dis(a, b)相等的点存在n个(包含点b), //那么在这n个点中任意选出两个点与点a构成三元组,则有n(n - 1) / 2种情况。 //但因为三元组[a, b, c]与三元组[a, c, b]并不相同,所以实际为排列问题,答案为n(n - 1)。 unordered_map<int,int> pointMap; int count = 0; for(int i = 0;i < points.size();i ++) { for(int j = 0;j < points.size();j ++) { int x = points[i].first - points[j].first; int y = points[i].second - points[j].second; int distance = x*x + y*y ; pointMap[distance] ++; } for(auto keyValuePair : pointMap) count += keyValuePair.second * (keyValuePair.second - 1); pointMap.clear(); } return count; }};
阅读全文
0 0
- Leetcode Number of Boomerangs 447
- leetcode-447-Number of Boomerangs
- LeetCode 447 Number of Boomerangs
- Leetcode 447 Number of Boomerangs
- LeetCode.447 Number of Boomerangs
- Leetcode Number of Boomerangs
- LEETCODE--Number of Boomerangs
- LeetCode : Number of Boomerangs
- leetcode[Number of Boomerangs]
- LeetCode No.447 Number of Boomerangs
- LeetCode 447. Number of Boomerangs
- leetcode:447. Number of Boomerangs
- leetcode 447. Number of Boomerangs
- LeetCode 447. Number of Boomerangs
- 【LeetCode】 447. Number of Boomerangs
- [LeetCode]447. Number of Boomerangs
- [leetcode] 447. Number of Boomerangs
- Leetcode 447. Number of Boomerangs
- 【1565】十进制数转二进制从低位到高位输出
- 14Python中的异常
- MYSQL:INNER JOIN的用法
- 欢迎使用CSDN-markdown编辑器
- PAT(Basic Level)Practise-----1001
- Leetcode 447 Number of Boomerangs
- pid max导致fork: Cannot allocate memory 的分析及解决办法
- hbase 源代码解析(23)truncate 和truncate_preserve流程分析
- lua解决八皇后问题
- Linux系统网卡名称固化
- 实验三、链队列和顺序队列
- Git简介
- Hbase遍历方式
- 171024—函数自学【知识点初识】