204. Count Primes

204. Count Primes

class Solution {
    public int countPrimes(int n) {
        int count = 0;
        for (int i = 2; i < n; i++){
            if (isPrime(i)) count++;
        }
        return count;
    }
    public boolean isPrime(int n){
        for (int i = 2; i*i <= n; i++){
            if ( n % i == 0) return false;
        }
        return true;
    }
}

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s