/**
* 最大公約數
*
* @param a
* @param b
* @return
*/
public static int gcd(int a, int b) {
int x = a > b ? a : b;
int y = a > b ? b : a;
int m = x % y;
while (m != 0) {
x = y;
y = m;
m = x % y;
}
return y;
}
/**
* 最小公倍數
*
* @param a
* @param b
* @return
*/
public static int lcm(int a, int b) {
return a * b / gcd(a, b);
}