about gcd and lcm(关于最大公约数和最小公倍数)

gcd-lcm.js

function gcd(x, y) {
    while (y) {
        [x, y] = [y, x % y];
    }
    return x;
}

const lcm = (x,y) => x * y / gcd(x,y);

function multipleLCM(...nums) {
    let [min, max] = (nums.length===1?nums[0]:nums).sort((a, b) => a - b);
    let arr = Array.from(new Array(max - min + 1),(val, index) => index + min);
    return arr.reduce((prev,cur) => lcm(prev, cur));
}
//demo
multipleLCM(1,5); //60
multipleLCM([1,5]); //60