204. Count Primes

最新推荐文章于 2025-09-07 20:32:33 发布

weixin_33929309

最新推荐文章于 2025-09-07 20:32:33 发布

阅读量52

点赞数

CC 4.0 BY-SA版权

文章标签： java runtime

原文链接：https://segmentfault.com/a/1190000018347077

本文介绍了一种使用素数筛选法统计小于非负整数n的所有素数数量的算法。通过创建一个布尔数组标记非素数，并遍历数组计算素数个数。此算法在Java在线提交中运行速度优于94.69%，但内存使用率低于21.43%。

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.

难度：easy

题目：统计小于非负整数n的所有素数。

思路：参考素数筛选法。

Runtime: 11 ms, faster than 94.69% of Java online submissions for Count Primes.
Memory Usage: 35.9 MB, less than 21.43% of Java online submissions for Count Primes.

class Solution {
    public int countPrimes(int n) {
        boolean[] notPrimes = new boolean[n];
        int count = 0;
        for (int i = 2; i < n; i++) {
            if (!notPrimes[i]) {
                count++;
                for (int j = 2 * i; j < n; j += i) {
                    notPrimes[j] = true;
                }
            }
        }
        
        return count;
    }
}