<p>任务:</p>
<blockquote>
<p>given an array A of N integers, returns the smallest positive integer
(greater than 0) that does not occur in A.</p>
</blockquote>
<p>我的代码:</p>
<pre><code>def search(A):
j=1
while j in A:
j+=1;
return j;
</code></pre>
<p>为什么我的时间复杂性是O(N^2)?你知道吗</p>