[Programmers/JavaScript/Lv.1] 최대공약수와 최소공배수 정답

정답

function solution(n, m) {
    const gcd = getGCD(n, m)
    return [gcd, (n * m) / gcd];
}

const getGCD = (num1, num2) => {
    let bigNum = Math.max(num1, num2);
    let smallNum = Math.min(num1, num2);
    
    while(smallNum > 0) {
        let r = bigNum % smallNum;
        bigNum = smallNum;
        smallNum = r;
    }
    return bigNum;
}

https://school.programmers.co.kr/learn/courses/30/lessons/12940

프로그래머스