擅长:python、mysql、java
<ul>
<li>时间复杂度=<code>O(n)</code></li>
<li>空间复杂性=<code>O(n)</code></li>
<li><p>代码:</p>
<pre><code>def get_duplicates(array):
seen = set([])
results = set([])
for element in array:
if element in seen:
results.add(element)
else:
seen.add(element)
return list(results)
input_array = "RGN RBM10 ARAF ZNF630 FTSJ1 SLC35A2 SLC35A2 SLC35A2 MAGIX DGKK XAGE1B XAGE1B SMC1A FAM120C CXorf49 CXorf49B CHIC1 ABCB7 PBDC1 FGF16 ATP7A CYLC1 TSPAN6 BTK BTK TCEAL4 TEX13A FRMPD3 PRPS1 COL4A6 COL4A6 COL4A6"
input_array = input_array.split()
duplicates = get_duplicates(input_array)
print(duplicates)
</code></pre></li>
<li><p>输出:<br/>
<code>['COL4A6', 'SLC35A2', 'XAGE1B', 'BTK']</code></p></li>
</ul>