通过遍历而非排序求最值 python list in 时间复杂度 列表元素存在性
2020-12-13 05:49
标签：pos returns list def each tin span continue number Write a function: def solution(A) that, given an array A of N integers, returns the smallest positive integer (greater than 0) that does not occur in A. For example, given A = [1, 3, 6, 4, 1, 2], the function should return 5. Given A = [1, 2, 3], the function should return 4. Given A = [−1, −3], the function should return 1. Write an efficient algorithm for the following assumptions: 通过遍历而非排序求最值 python list in 时间复杂度 列表元素存在性 标签：pos returns list def each tin span continue number 原文地址：https://www.cnblogs.com/yuanjiangw/p/11149616.html
def solution(A):
ret = 1
c = len(A)
for i in range(0, c, 1):
if A[i] continue
if ret not in A:
return ret
else:
ret += 1
return ret
python list in 时间复杂度 列表元素存在性
文章标题：通过遍历而非排序求最值 python list in 时间复杂度 列表元素存在性
文章链接：http://soscw.com/essay/31806.html