[LeetCode] 204. Count Primes
文章目录
Problem
Count the number of prime numbers less than a non-negative number, n.
Example:
Input: 10
Output: 4
Explanation: There are 4 prime numbers less than 10, they are 2, 3, 5, 7.
Solution
class Solution {
public int countPrimes(int n) {
boolean[] notPrime = new boolean[n];
int count = 0;
for (int i = 2; i < n; i++) {
if (!notPrime[i]) {
count++;
for (int j = 2; j*i < n; j++) {
notPrime[i*j] = true;
}
}
}
return count;
}
}

评论
登录后参与技术讨论,分享你的经验与见解。
登录 / 注册暂无评论