@@ -0,0 +1,473 @@
+/**%0A * Count the number of prime numbers less than a non-negative number, n.%0A */%0Apublic class Solution %7B%0A    public int countPrimes(int n) %7B%0A    %09if (n %3C 3) return 0;%0A    %09BitSet flags = new BitSet(n);%0A        for(int i = 2; i %3C n; i++)%0A    %09    flags.set(i);%0A    %09for(int i = 2; i * i %3C n; i++) %7B%0A    %09%09if(flags.get(i)) %7B%0A    %09%09%09for(int j = i*i; j %3C n; j += i)%0A    %09%09%09%09flags.set(j, false);%0A    %09%09%7D else%0A    %09%09%09continue;%0A    %09%7D%0A    %09return flags.cardinality();%0A    %7D    %0A%7D%0A

Create 204.java