题解 | 求最小公倍数

import java.util.*;

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) {

        //write your code here......
        // int min = m < n ? m : n;
        // int num = min;
        // while(num % m != 0 || num % n != 0){
        //     num++;
        // }
        // return num;

        int multipleOfM = m, multipleOfN = n;
        while(multipleOfM != multipleOfN){
            if(multipleOfM < multipleOfN){
                multipleOfM += m;
            }
            else{
                multipleOfN += n;
            }
        }
        return multipleOfM;
    }
}