首页 > 其他 > 详细

查找表_leetcode447

时间:2019-03-17 15:36:34      阅读:204      评论:0      收藏:0      [点我收藏+]
# 解题思路:字典先存距离信息 20190302 找工作期间
# n2

class Solution:
def numberOfBoomerangs(self, points):
"""
:type points: List[List[int]]
:rtype: int
"""

def dis( point1, point2):
return (point1[0] - point2[0]) ** 2 + (point1[1] - point2[1]) ** 2

result = 0
for i in points:
record = {}
for j in points:
if j != i:
distance = dis(i, j)
record[distance] = record.get(distance, 0) + 1

for val in record.values():
if val >= 2:
result += (val - 1)* val
return result


查找表_leetcode447

原文:https://www.cnblogs.com/lux-ace/p/10546960.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!