최대공약수와 최소공배수

public class Solution
        {
            public int[] solution(int n, int m)
            {
                int max;
                int min;
                int[] answer = new int[2];
                
                max = n * m / GCD(n, m);
                min = GCD(n, m);
                answer = new int[] { min, max };
                return answer;
            }

            int GCD(int a, int b)
            {
                return b == 0 ? a : GCD(b, a % b);
            }
        }