leetcode204

public class Solution {
    public int CountPrimes(int n) {
        if (n <= )
            {
                return ;
            }

            long[] prime = new long[n + ];
            bool[] mark = new bool[n + ];

            int primeSize = ;

            for (int i = ; i < n; i++)
            {
                mark[i] = false;
            }

            for (long i = ; i < n; i++)
            {
                if (mark[i] == true)
                {
                    continue;
                }
                prime[primeSize++] = i;
                for (long j = i * i; j <= n; j += i)
                {
                    mark[j] = true;
                }
            }

            return primeSize;
    }
}

https://leetcode.com/problems/count-primes/#/description

这道题目是意思是，计算比n小的非负数中有多少素数。

例如：

n = 7，素数有2，3，5（不包含7）一共3个

n = 8，素数有2，3，5，7一共4个

使用素数筛法可以提高效率。

python的实现如下：

 class Solution:
     def countPrimes(self, n: int) -> int:
         nfilter = [False] * n
         count =
         for i in range(,n):
             if nfilter[i]:
                 continue
             count +=
             k = i + i
             while k < n:
                 nfilter[k] = True
                 k += i
         return count