回答此问题可获得 20 贡献值,回答如果被采纳可获得 50 分。
<p>我正在比较两个整数列表,并尝试在不使用for循环的情况下访问最低值,因为列表非常大。我尝试过使用集合比较,但这样做时我收到一个空集合。目前我的做法是:</p>
<pre><code>differenceOfIpLists = list(set(reservedArray).difference(set(ipChoicesArray)))
</code></pre>
<p>我也尝试过:</p>
<pre><code>differenceOfIpLists = list(set(reservedArray) - set(ipChoicesArray))
</code></pre>
<p>列表的定义如下:</p>
<pre><code>reservedArray = [169017344, 169017345, 169017346, 169017347, 169017348, 169017349, 169017350, 169017351, 169017352, 169017353, 169017354, 169017355, 169017356, 169017357, 169017358, 169017359, 169017360, 169017361, 169017362, 169017363, 169017364, 169017365, 169017366, 169017367, 169017368, 169017369, 169017600, 169017601, 169017602, 169017603, 169017604, 169017605, 169017606, 169017607, 169017608, 169017609, 169017610, 169017611, 169017612, 169017613, 169017614, 169017615, 169017616, 169017617, 169017618, 169017619...]
ipChoicesArray = [169017344, 169017345, 169017346, 169017347, 169017348, 169017349, 169017350, 169017351, 169017352, 169017353, 169017354, 169017355, 169017356, 169017357, 169017358, 169017359, 169017360, 169017361, 169017362, 169017363, 169017364, 169017365, 169017366, 169017367, 169017368, 169017369, 169017370, 169017371, 169017372, 169017373, 169017374, 169017375, 169017376, 169017377, 169017378, 169017379, 169017380, 169017381, 169017382...]
</code></pre>
<p>这些列表的部分内容是相同的,但它们的长度却大不相同:</p>
<pre><code>reservedArrayLength = 6658
ipChoicesArray = 65536
</code></pre>
<p>我还尝试将这些值转换为字符串,并进行相同风格的比较,但也无济于事</p>
<p>一旦我能够提取ipChoicesArray中不在reservedArray中的元素列表,我将在排序后返回最小的元素</p>
<p>我不相信我面临的是最大长度问题</p>