447. Number of Boomerangs
来源:互联网 发布:国际银行数据 编辑:程序博客网 时间:2024/06/04 17:45
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:2Explanation:The two boomerangs are [[1,0],[0,0],[2,0]] and [[1,0],[2,0],[0,0]]
class Solution {public: int numberOfBoomerangs(vector<pair<int, int>>& points) { int s = 0; int sz = points.size(); for(int i = 0; i < sz; ++i){ int x0 = points[i].first; int y0 = points[i].second; map<int, int> dis; for(int j = 0; j < sz; ++j){ int d1 = points[j].first - x0; int d2 = points[j].second - y0; int d = d2 * d2 + d1 * d1; dis[d]++; } for(auto itr = dis.begin(); itr != dis.end(); ++itr){ s += (itr->second) * (itr->second - 1); } } return s; }};
0 0
- 447. Number of Boomerangs
- 447. Number of Boomerangs
- 447. Number of Boomerangs
- 447. Number of Boomerangs
- 447. Number of Boomerangs
- 447. Number of Boomerangs
- 447. Number of Boomerangs
- 447. Number of Boomerangs
- 447. Number of Boomerangs
- 447. Number of Boomerangs*
- 447. Number of Boomerangs
- 447. Number of Boomerangs
- 447. Number of Boomerangs
- 447. Number of Boomerangs
- 447. Number of Boomerangs
- 447. Number of Boomerangs
- 447. Number of Boomerangs
- 447. Number of Boomerangs
- java的io简单操作
- 基础部分--机器码篇
- hibernate配置多对一的关系的时候,从多方删除信息报错
- Android app跳转QQ加人聊天或者加群
- java中long类型转换为int类型
- 447. Number of Boomerangs
- Java常用面试题17 计算文件中指定字符出现的次数
- Java多线程-工具篇-BlockingQueue
- Android中ScrollView和WebView滑动冲突
- 支付宝支付iOS
- uniq命令
- JAVA 堆和栈
- 秒杀系统架构优化思路
- 天工架构