求两个数的最小公倍数

两个数的最下公倍数 = 两个数的乘积 / 两个数的最大公约数

import java.util.*;
public class Main{
    public static void main(String[] args){
        Scanner scanner = new Scanner(System.in);
        while(scanner.hasNext()){
            int a = scanner.nextInt();
            int b = scanner.nextInt();
            System.out.println(minCommonMultiple(a,b));
        }
    }
    //递归求最大公约数
    public static int maxCommonDivisor(int m,int n){
        if(m < n){
            int temp = m;
            m = n;
            n = temp;
        }
        while(m % n == 0){
            return n;
        }
        return maxCommonDivisor(n ,m % n);
    }
    //求最小公倍数
    public static int minCommonMultiple(int m,int n){
        return m * n / maxCommonDivisor(m,n);
    }
}