数据结构与算法之--最大公约数、最小公倍数

package com.lfy;

import java.util.Scanner;

/**
 * 
 * @author lfy
 * @since  2018/07/03
 * @version 1.0
 */
public class LeastCommonMultiple {

    public static void main(String[] args) {
        @SuppressWarnings("resource")
        Scanner input=new Scanner(System.in);
        int num1=input.nextInt();
        int num2=input.nextInt();
        //求两个数的最小公倍数
        System.out.println(get_LeastCommonMultiple(num1,num2));
    }

    //最小公倍数
    private static int get_LeastCommonMultiple(int num1, int num2) {
        
        return num1*num2/get_GreatestCommonDivisor(num1,num2);
    }

    //最大公约数
    private static int get_GreatestCommonDivisor(int num1, int num2) {
        int res=0;
        if(num1<num2) {
            num1=num1+num2;
            num2=num1-num2;
            num1=num1-num2;
        }
        if(num1%num2==0) {
            res=num2;
        }
        while(num1%num2>0) {
            num1=num1%num2;
            if(num2>num1) {
                num1=num1+num2;
                num2=num1-num2;
                num1=num1-num2;
            }
            if(num1%num2==0) {
                res=num2;
            }
        }
        return res;
    }

}