-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
447.py
33 lines (30 loc) · 1.22 KB
/
447.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
__________________________________________________________________________________________________
sample 248 ms submission
import numpy as np
from numpy import *
from scipy.spatial.distance import pdist, squareform
class Solution:
def numberOfBoomerangs(self, points: List[List[int]]) -> int:
a = squareform(pdist(np.array(points)))
result = 0
for i in a:#遍历每一行
count = np.unique(i,return_counts=True)[1]
result += sum(count*(count - 1))
return result
__________________________________________________________________________________________________
sample 13328 kb submission
class Solution:
def numberOfBoomerangs(self, points: List[List[int]]) -> int:
from collections import defaultdict
ans = 0
for i in range(len(points)):
p = points[i]
d = defaultdict(int)
for j in range(len(points)):
if j != i:
q = points[j]
d[abs(complex(*p) - complex(*q))] += 1
for k in d:
ans += d[k]*(d[k]-1)
return ans
__________________________________________________________________________________________________