let n = [1, 2, 3, 4, 5, 6, 7, 8, 9], k = 3;
let item = [], sum = 0, count = 0, index = 0;
function f(x) {
let len = x.length;
for (let s = 0; s < len; s++) {
let num = x[s] * 1;
item[index] = num
sum += num;
if (item.length == k) {
count++;
console.log(item, sum + "是否是素数", isSuShu(sum));
}
if (index < k - 1) {
let m = x.slice(s + 1);
index++;
f(m)
}
sum -= num;
}
index--;
item.pop();
}
f(n);
function isSuShu(sum) {
for (let i = 2; i < sum; i++) {
if (sum % i == 0) {
return false;
}
}
return true;
}
console.log('组合个数', count)
从N个数中取出k个求和判断和是否是素数
最新推荐文章于 2022-10-18 21:40:08 发布