Java 素数 prime numbers-LeetCode 204

Description:

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

click to show more hints.

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

求n以内的所有素数，以前看过的一道题目，通过将所有非素数标记出来，再找出素数，代码如下：

     public int countPrimes(int n) {
         if (n == 0 || n == 1 || n == 2)
             return 0;
         int[] flag = new int[n];
         for (int i = 2; i < Math.sqrt(flag.length); i++) {
             if (flag[i] == 0)
                 for (int j = i; i * j < flag.length; j++) {
                     flag[i * j] = 1;
                 }
         }
         int count = 0;
         for (int i = 2; i < flag.length; i++)
             count += flag[i];
         BitSet bs = new BitSet();
         bs.ne
         return flag.length - count - 2;
     }

值得注意的是外循环只需要到根号n即可，因为内循环是从i*j即i平方开始的。在LeetCode如果没加根号会产生溢出