力扣-12.29-204

方法一：

class Solution {
    public boolean isPrime(int x) {
        for(int i = 2; i <= Math.sqrt(x); i++) {
            if(x % i == 0) {
                return false;
            }
        }
        return true;
    }
    public int countPrimes(int n) {
        int count = 0;
        for (int i = 2; i < n; i++) {
            if (isPrime(i)) {
                count++;
            }
        }
        return count;
    }
}

会超时！！！
不用Math.sqrt()函数就不会超时，但是效率很低

class Solution {
    public boolean isPrime(int x) {
        for(int i = 2; i * i <= x; i++) {
            if(x % i == 0) {
                return false;
            }
        }
        return true;
    }
    public int countPrimes(int n) {
        int count = 0;
        for (int i = 2; i < n; i++) {
            if (isPrime(i)) {
                count++;
            }
        }
        return count;
    }
}

方法二：
（需掌握！！！）

class Solution {
    public int countPrimes(int n) {
        int[] prime = new int[n];
        Arrays.fill(prime, 1);
        int ans = 0;
        for (int i = 2; i < n; i++) {
            if(prime[i] == 1) {
                ans++;
                if ((long) i * i < n) {
                    for(int j = i * i; j < n; j += i) {
                        prime[j] = 0;
                    }
                }
            }
        }
        return ans;
    }
}