public class HomeWork {
/**
* 暴力破解法求最大公约数
*/
public static int getMaxPact(int m, int n) {
int res = 0;
for (int i = m > n ? n : m; i >= 1; i--) {
if (m % i == 0 && n % i == 0) {
res = i;
break;
}
}
return res;
}
/**
* 用辗转相除法求最大公约数
*
* @param m
* @param n
* @return
*/
public static int getMaxPact1(int m, int n) {
if (m < n) {
int temp = m;
m = n;
n = temp;
}
// m>=n
int k = 0;
while (m % n != 0) {
k = m % n;
m = n;
n = k;
}
return n;
}
/**
* 暴力破解法求最下公倍数
*
* @param m
* @param n
* @return
*/
public static int getMinGongBei(int m, int n) {
for (int i = m > n ? m : n; i < m * n; i++) {
if (i % m == 0 && i % n == 0) {
return i;
}
}
return m * n;
}
public static int getMinGongBei1(int m, int n) {
int k = HomeWork.getMaxPact(m, n);// 先求出最大公约数
return (m / k) * (n / k) * k;
}
public static void main(String[] args) {
int m = 64;
int n = 32;
// System.out.println(HomeWork.getMaxPact1(m, n));
// System.out.println(HomeWork.getMinGongBei(m, n));
// System.out.println(HomeWork.getMinGongBei1(m, n));
}
}