public static int eratosthenes(int n){
boolean[] isPrime = new boolean[n];
int count = 0;
for (int i = 2; i < n; i++){
if (!isPrime[i]){
count++;
for (int j = i*i; j < n; j+=i){
isPrime[j] = true;
}
}
}
return count;
}
[算法系列] 统计素数——埃氏算法(Java)
于 2024-01-27 16:52:35 首次发布