每日一道Leetcode - 204. 计数质数

class Solution:
    def countPrimes(self, n: int) -> int:
        isPrime = [True]*n
        for i in range(2,n):
            if i*i < n:
                if isPrime[i]:
                    # 当前是质数
                    for j in range(i*i,n,i):
                        isPrime[j] = False
        return isPrime[2:].count(True)