2016年11月9日
[LeetCode] Number of Boomerangs 回旋镖的数量
摘要： 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 阅读全文
posted @ 2016-11-09 23:59 Grandyang 阅读(10048) 评论(6) 推荐(0)
Fork me on GitHub