def countPrimes(self, n):
"""
list[i:j:m] 表示[i,j]之间索引是m的倍数的值
"""
if n == 1 or n == 2:
return 0
primes = [True] * n
primes[0] = primes[1] = False
for i in range(2, int(n ** 0.5) + 1):
if primes[i]:
primes[i * i: n: i] = [False] * len(primes[i * i: n: i])
print(sum(primes))
参考链接:https://blog.csdn.net/github_39261590/article/details/73864039