Description:
Count the number of prime numbers less than a non-negative number, n
Java:
public class Solution {
public int countPrimes(int n) {
if(n < 2) return 0;
int index = 0;
int[] nums = new int[n+1];
for(int i = 2; i<n; i++)
{
if(nums[i] != 1)
{
nums[i] = 0;
index++;
int k = i;
while(k< n)
{
nums[k] = 1;
k += i;
}
}
}
return index;
}
}
参考: http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes