题解 | #求最小公倍数#

import java.util.Scanner;

/**
 * @ProjectName: leetcode
 * @Package: com.company.niuke
 * @ClassName: Lcm
 * @Author: Administrator
 * @Description: 最小公倍数
 * @Date: 2022/2/11 22:38
 * @Version: 1.0
 */
public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String[] num = scanner.nextLine().trim().split(" ");
        int i = Integer.valueOf(num[0]);
        int j = Integer.valueOf(num[1]);
        //求i和j的最小公倍数
        System.out.println(getLcm(i, j));
    }

    //使用欧几里得算法求解数m和数n最大公约数
    public static int getGcd(int m,int n){
        while(n > 0){
            int temp = m % n;
            m = n;
            n = temp;
        }
        return m;
    }

    //求解数m和n和最小公倍数
    public static int getLcm(int m,int n){
        int gcd = getGcd(m,n);
        int result = m*n / gcd;
        return result;
    }

}