题目:
题解:
MX=5000000
is_prime = [1] * MX
is_prime[0]=is_prime[1]=0
for i in range(2, MX):if is_prime[i]:for j in range(i * i, MX, i):#循环每次增加iis_prime[j] = 0
class Solution:def countPrimes(self, n: int) -> int:return sum(is_prime[:n])
题目:
题解:
MX=5000000
is_prime = [1] * MX
is_prime[0]=is_prime[1]=0
for i in range(2, MX):if is_prime[i]:for j in range(i * i, MX, i):#循环每次增加iis_prime[j] = 0
class Solution:def countPrimes(self, n: int) -> int:return sum(is_prime[:n])