Count the number of prime numbers less than a non-negative number, n.
Example 1:
Input: n = 10
Output: 4
Explanation: There are 4 prime numbers less than 10, they are 2, 3, 5, 7.
Example 2:
Input: n = 0
Output: 0
Example 3:
Input: n = 1
Output: 0
Constraints:
0 <= n <= 5 * 106
超时了
class Solution {
public:
int countPrimes(int n) {
int res = 0;
if(n <= 2)
return res;
for(int i = 2; i < n; i++){
int flag = 0;
for(int j = 2; j*j <= i; j++){
if(i % j == 0){
flag = 1;
break;
}
}
if(!flag)
res++;
}
return res;
}
};
另一种方法是从2到n遍历,把其中质数的倍数标为合数,最后剩下的就是质数了。
class Solution {
public:
int countPrimes(int n) {
if(n <= 2)
return 0;
vector<int> primes(n, true);
int count = n - 2; //0-n-1一共n个数,先去掉0和1
for(int i = 2; i < n; i++){
if(primes[i]){
for(int j = 2*i; j < n; j += i){
if(primes[j]){//count别减重了
primes[j] = false;
count --;
}
}
}
}
return count;
}
};
优化一下,跳过偶数
class Solution {
public:
int countPrimes(int n) {
if(n <= 2)
return 0;
vector<int> primes(n, true);
int i = 3, count = n/2;
while(i*i < n){
for(int j = i*i; j < n; j += 2*i)//这里直接从i*i开始而不是3*i开始是因为3*i在3那一轮已经遍历过了,每个i从自己平方开始就行
{
if(primes[j]){
primes[j] = false;
count--;
}
}
do{
i += 2;//跳过偶数
}while(i*i < n && !primes[i]);//跳过合数,避免重复遍历
}
return count;
}
};