JAVA实现最大公因数与最小公倍数计算
最大公因数
Greatest Common Divisor (GCD)
public static long gcd(long a, long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
最小公倍数
Lowest Common Multiple (LCM)
public static long lcm(long a, long b) {
return (a * (b / gcd(a, b)));
}