[英]I'm trying this question but unable to solve this. Anyone please help me with this
在 javascript 中編寫一個程序,找出從 2 到 n 的數列中素數的個數。 [2, n]
輸入格式: A single integer (n). 2 <= n <= 100.
A single integer (n). 2 <= n <= 100.
程序:
function primeCount(input) {
let primeCount;
return primeCount;
}
function isPrimeNumber(num) {
for ( let i = 2; i < num; i++ ) {
if ( num % i === 0 ) {
return false;
}
}
return true;
}
function displayValue(n) {
var arr = [2];
for ( let i = 3; i < n; i+=2 ) {
if ( isPrimeNumber(i) ) {
arr.push(i);
}
}
console.log(arr); // use arr result on your own
}
displayValue(100);
聲明:本站的技術帖子網頁,遵循CC BY-SA 4.0協議,如果您需要轉載,請注明本站網址或者原文地址。任何問題請咨詢:yoyou2525@163.com.