擅长:python、mysql、java
<p>一种有时可以加快速度的预计算是<a href="https://docs.scipy.org/doc/scipy/reference/generated/scipy.spatial.cKDTree.html" rel="nofollow noreferrer">kd-trees</a>。我运行了一个针对暴力的快速测试,发现对于更大的列表,它们可以更快一些:</p>
<pre><code># n = 10
# trees 0.08512560 ms
# brute 0.01425540 ms
# n = 100
# trees 0.20338160 ms
# brute 0.09876890 ms
# n = 1000
# trees 6.40193820 ms
# brute 16.15429670 ms
# n = 10000
# trees 298.69653380 ms
# brute 1393.71134270 ms
</code></pre>
<p>代码:</p>
^{pr2}$