Leetcode 204. 计数质数

204. 计数质数

Ideas

算法：迭代
埃氏筛

Code

class Solution:
    def countPrimes(self, n: int) -> int:
        l = [1 for _ in range(n)]
        for i in range(2,int(n ** 0.5) + 1):
            if l[i]:
                for j in range(i * i, n, i):
                    l[j] = 0
        ans = 0
        for i in range(2, n):
            if l[i]:
                ans += 1
        return ans