204. Count Primes - LeetCode

Queston

204.?Count Primes

Solution

题目大意：给一个数，求小于这个数的素数的个数

思路：初始化一个boolean数组，初始设置为true,先遍历将2的倍数设置为false，再遍历3并将3的倍数置为false...

Java实现：

此法超时

public int countPrimes(int n) {
    // 2, 3, 5, 7
    boolean[] candidate = new boolean[n];
    Arrays.fill(candidate, Boolean.TRUE);
    candidate[0] = false;
    candidate[1] = false;
    int count = 0;
    for (int i=2; i<n; i++) {
        if (candidate[i]) {
            count++;
            for (int j = i+1; j<n; j++) {
                if (j%i==0) candidate[j] = false;
            }
        }
    }
    return count;
}

参考别人的：

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

204. Count Primes - LeetCode

原文：https://www.cnblogs.com/okokabcd/p/9361626.html