Get gcd, lcm

Solution.java

publi class Solution {
  public int[] solution(int n, int m) { 
      int[] answer = {gcd(n, m), lcm(n, m)};
      return answer;
  }
    
  private int gcd(int a, int b) { // 최대공약수
    while (b > 0) {
      int tmp = a;
      a = b;
      b = tmp % b;
    }
    return a;
  }
    
  private int lcm(int a, int b) { // 최소공배수
    return a * b / gcd(a, b);
  }
}