java筆試之求最小公倍數

正整數A和正整數B 的最小公倍數是指 能被A和B整除的最小的正整數值，設計一個算法，求輸入A和B的最小公倍數。

package test;

import java.util.Scanner;

public class exam06 {

    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(min(a, b));
        }
        scanner.close();
    }

    // 求最大公約數
    public static int gcd(int a, int b) {
        return (b == 0) ? a : gcd(b, a % b);
    }

    public static int min(int a, int b) {
        return a * b / gcd(a, b);
    }
}      

轉載于:https://www.cnblogs.com/bella-young/p/6409023.html