题解 | 求最小公倍数

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner console = new Scanner(System.in);
        int m = console.nextInt();
        int n = console.nextInt();
        int result = getCM(m, n);
        System.out.println(result);
    }

    public static int getCM(int m, int n) {
        // 先求最大公约数
        int gcd = getGCD(m, n);
        // 计算最小公倍数
        return m * n / gcd;
    }

    // 辗转相除法求最大公约数
    public static int getGCD(int a, int b) {
        while (b != 0) {
            int temp = b;
            b = a % b;
            a = temp;
        }
        return a;
    }
}