[Level 1] 최대공약수와 최소공배수

class Solution {
    public int[] solution(int n, int m) {
        int[] answer = new int[2];
        answer[0] = gcd(n,m); answer[1] = (int)(n*m/gcd(n,m));
        
        return answer;
    }
    
    public int gcd(int n1, int n2) {
        if(n2==0) { return n1; }
        
        return gcd(n2, n1%n2);
    }
}