擅长:python、mysql、java
<p>不清楚这是否是您要查找的内容,而且<code>i + 1</code>看起来很奇怪,但它返回了符合您的规范的正确结果</p>
<pre><code>def best_cafe(l1, l2):
match = []
for i, item in enumerate(l1):
if item not in l2:
continue
match.append(i + 1)
return min(match)
l3 = [1, 2, 3]
l4 = [3, 1, 4]
l1 = [1, 2, 3]
l2 = [2, 4, 3]
print best_cafe(l3, l4)
print best_cafe(l1, l2)
</code></pre>