[Programmers] Lv1: 최대공약수와 최소공배수(12940)

문제

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

 

풀이

class Solution {
    public int[] solution(int n, int m) {
        int[] answer = new int[2];
        answer[0] = gcd(n, m);
        answer[1] = n * m / answer[0];
        return answer;
    }
    
    private static int gcd(int a, int b) {
        int r = 0;
        while (b > 0) {
            r = a % b;
            a = b;
            b = r;
        }
        return a;
    }
}