擅长:python、mysql、java
<p>嗯,快点。对于每个内部迭代,原始版本的时间复杂性为<code>O(3n)</code>。在</p>
<p>下面是时间复杂度更快的<code>O(nlg3)</code>。在</p>
<pre><code>from queue import PriorityQueue
q = PriorityQueue(maxsize=3)
for item in set1:
map(q.put, (-1 * magicComp(item,stuff) for stuff in set2))
max = []
while not q.empty():
max.append(-1 * q.get())
</code></pre>