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.

Analysis:

本题的思路是维持一个boolean数组用来保存每个值的状态，但是对于判断一个数是否是质数，则需要判定它的素因子，但是无需判断所有小于它的数值，而只需找小于Sqrt(n)的数字。代码如下：

Code:

class Solution {
    public int countPrimes(int n) {
        if(n < 2)
            return 0;
        boolean[] temp = new boolean[n];
        temp[1] = false;
        int res = 0;
        for(int i = 2; i < n; i++) {
            if(temp[i] == false) {
                if(isPrime(i)) {
                    res++;
                    for(int j = i; j < n;) {
                        temp[j] = true;
                        j += i;
                    }   
                }
            }
        }
        return res;
        
    }
    boolean isPrime(int a) {
        if(a == 1)
            return false;
        int ans = (int)Math.sqrt(a);
        for(int i = 2; i < ans + 1; i++) {
            if(a%i == 0) {
                return false;
            }
        }
        return true;
    }
}