1、求最小公倍数方法
function minCommonMultiple(...arr){
let c = arr.reduce((x, y) => x * y)
for (let i = 1; i <= c; i++) {
if (arr.every(item => i % item == 0)) {
return i
}
}
}
minCommonMultiple(2, 3); // 6
minCommonMultiple(4, 12, 13); // 156
2、求最大公约数方法
function maxCommonDivisor(...arr){
let commonDivisor = 1;
for (let i = 1; arr.every(item => i <= item); i++) {
if (arr.every(item => item % i == 0)) {
commonDivisor = i;
}
}
return commonDivisor
}
maxCommonDivisor(3, 6, 12); // 3
maxCommonDivisor(6, 12, 24); // 6