447.Number of Boomerangs

来自WHY42
Riguz（讨论 | 贡献）2024年1月17日 (三) 15:48的版本 （创建页面，内容为“=Description= {{LeetCode |id=number-of-boomerangs |no=447 |difficulty=Medium |category=unknown |collection=Top 150 |title=Number of Boomerangs |summary=You are given n points in the plane that are all distinct, where points[i] = [xi, yi]. 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).}} Category:Algorithm Category:LeetCode”）
(差异) ←上一版本 | 最后版本 (差异) | 下一版本→ (差异)

Description

#447 Number of Boomerangs Medium
unknown Top 150
You are given n points in the plane that are all distinct, where points[i] = [xi, yi]. 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).
取自“https://riguz.com/index.php?title=447.Number_of_Boomerangs&oldid=3982”