要求用O(n)的时间复杂度进行查找:
1. 申请额外空间n个空间,记录当前数字是否出现过
def find1(a, n):
res = []
b = [0 for x in range(n)]
for i in a:
b[i-1] = 1
for i in range(n):
if b[i] == 0:
res.append(i+1)
return res
2.利用数学公式,先求1到n的平方和和1到n的平方和,再求1到n的平方和和1到n的和,两式相减解方程
def find2(a, n):
sum1, sum2, sum1_, sum2_ = 0, 0, 0, 0
for i in a:
sum1 += i
sum1_ += i**2
for i in range(1, n+1):
sum2 += i
sum2_ += i**2
sum_ = sum2 - sum1
sum__ = sum2_ - sum1_
for i in range(n):
if i**2 + (sum_ - i) ** 2 == sum__:
return [i, sum_-i]