@@ -0,0 +1,407 @@
+public class Solution %7B%0A%0A    public int countPrimes(int n) %7B%0A%0A        boolean%5B%5D notPrime = new boolean%5Bn%5D;%0A%0A        int count = 0;%0A%0A        for (int i = 2; i %3C n; i++) %7B%0A%0A            if (notPrime%5Bi%5D) %7B%0A                continue;%0A            %7D%0A%0A            count++;%0A%0A            for (int j = i; j %3C n; j = i + j) %7B%0A                notPrime%5Bj%5D = true;%0A            %7D%0A%0A        %7D%0A%0A        return count;%0A%0A    %7D%0A%0A%7D%0A

Create : 204 Count Primes