作者:青青河边羊 | 来源:互联网 | 2023-09-25 13:35
1.问题描述描述:Given n pointsintheplanethatareallpairwisedistinct,aboomerangisatupleofpoints (
1.问题描述
描述:
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).
示例:
Input:
[[0,0],[1,0],[2,0]]
Output:
2
Explanation:
The two boomerangs are [[1,0],[0,0],[2,0]] and [[1,0],[2,0],[0,0]]
2.问题分析
- 第一遍:
leetcode447-Number of Boomerangs