两层循环,
let N = parseInt(readline());
function PrimeFactor(n) {
let k = Math.sqrt(n);
let arr = [];
for (let i = 2; i <= k; i++) {
while (n % i == 0) {
arr.push(i);
n /= i;
}
}
if (n != 1) arr.push(n);
return arr.join(' ')
}
print(PrimeFactor(N));
一层循环
let num = parseInt(readline());
let arr = []; // 结果数组
let i = 2, k = Math.sqrt(num)
while (i <= k) {
if (num % i === 0) {
arr.push(i);
num /= i;
i = 2;
} else i++
}
if (num != 1) arr.push(num);
console.log(arr.join(' '));