最小公倍数/最大公约数 java计算

// greatest common divisor
public int gcd(int m, int n) {
            if (n > m) {
                return gcd(n, m);
            }
            while (n > 0) {
                int t = m % n;
                m = n;
                n = t;
            }
            return m;
        }

// lowest common multiple
 public int lcm(int m, int n) {
            return (m * n) / gcd(m, n);
  }