leetcode--Count Primes

Count Primes:

Count the number of prime numbers less than a non-negative number, n.

One：

埃拉托斯特尼筛法 Sieve of Eratosthenes

思路：素数不能被比它小的整数整除, 建一个boolean 数组, 从2开始, 把其倍数小于N的都删掉.

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

two：

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

three:

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