204. Count Primes

Description:

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

Credits:
Special thanks to @mithmatt for adding this problem and creating all test cases.

统计小于n 的质数的个数。创建大小n 的数组保存当前数是不是质数。外围从2到n遍历，统计不是素数的元素，如果是质数，里面循环从2开始，对于i * j的元素记录为不是质数。代码如下：

public class Solution {
    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;
    }
}