Count the number of prime numbers less than a non-negative number, n.
var countPrimes = function(n) {
var arr= [];
for(var m = 0; m < n; m++) {
arr[m] = true
}
for(var i = 2; i < n; i++){
// 将i的2倍、3倍、4倍...都标记为非素数
for(var j = i * 2; j < n; j = j + i){
arr[j] = false;
}
}
var count = 0;
for(var i = 2; i < n; i++){
if(arr[i]) count++;
}
return count;
};