Count-Primes

Count Primes

Difficulty:

Easy

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.

Hint:

1. Let’s start with a isPrime function. To determine if a number is prime, we need to check if it is not divisible by any number less than n. The runtime complexity of isPrime function would be O(n) and hence counting the total prime numbers up to n would be O(n2). Could we do better?

Code

Java

Runtime: 244 ms

public class Solution {
public int countPrimes(int n) {
if(n<=2) return 0;
boolean[] flag = new boolean
;
int result = 1;
for(int i = 3; i<n ; i = i+2){
if(!flag[i-1]){
result++;
for(int k = 3; k*i < n; k = k+2){
if(!flag[k*i-1])
flag[k*i-1]= true;
}
}
}
return result;

}
}