python中给出一个不超过10的正整数n怎么表示_Python给定一个由N个整数组成的数组A，返回在in O（N）时间复杂度中不出现的最小正整数（大于0）...

我写了两个解决那个问题的方法。第一个很好，但我不想使用任何外部库+它的O(n)*log(n)复杂性。第二个解决方案“我需要你的帮助来优化它”给出了一个错误，当输入是混沌序列长度=10005(带负号)。

解决方案1：from itertools import count, filterfalse

def minpositive(a):

return(next(filterfalse(set(a).__contains__, count(1))))

解决方案2：def minpositive(a):

count = 0

b = list(set([i for i in a if i>0]))

if min(b, default = 0) > 1 or min(b, default = 0) == 0 :

min_val = 1

else:

min_val = min([b[i-1]+1 for i, x in enumerate(b) if x - b[i - 1] >1], default=b[-1]+1)

return min_valNote: This was a demo test in codility, solution 1 got 100% and

solution 2 got 77 %.

Error in "solution2" was due to:

Performance tests ->

medium chaotic sequences length=10005 (with minus) got 3 expected

10000

Performance tests -> large chaotic + many -1, 1, 2, 3 (with

minus) got 5 expected 10000