204. 计数质数
厄拉多塞筛法求小于n的质数的个数
class Solution {
public int countPrimes(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;
}
}