题目:
Description:
Count the number of prime numbers less than a non-negative number, n.
解答:
此题利用的是类似于排除法,具体做法题目中的hint讲的很清楚
class Solution {
public:
int countPrimes(int n) {
int *isPrime = new int[n];
for(int i = 2;i < n; ++i)
isPrime[i] = 1;
for(int i = 2;i * i < n;++i)
{
if(!isPrime[i])
continue;
else
{
for(int j = i * i;j < n; j += i)
isPrime[j] = 0;
}
}
int cnt = 0;
for(int i = 2;i < n; ++i)
if(isPrime[i])
cnt++;
return cnt;
}
};
还有另一份更精巧的代码,目前只看懂了一部分的思想,其他的等我看懂了再写,先附上代码
class Solution {
public:
int countPrimes(int n) {
if(--n < 2) return 0;
int m = (n + 1)/2, count = m, k, u = (sqrt(n) - 1)/2;
bool notPrime[m] = {0};
for(int i = 1; i <= u;i++)
if(!notPrime[i])
for(k = (i+ 1)*2*i; k < m;k += i*2 + 1)
if (!notPrime[k])
{
notPrime[k] = true;
count--;
}
return count;
}
};