最大公约数和最小公倍数

package com.heda.code;

public class GcdLcm {
	/**
	 *  最大公约数
	 * @param m
	 * @param n
	 * @return
	 */
	public static int gcdOf(int m, int n) {
		int r;
		while (n != 0) {
			r = m % n;
			m = n;
			n = r;
		}
		return m;
	}
	/**
	 * 最小公倍数
	 * @param m
	 * @param n
	 * @return
	 */
	public static int lcmOf(int m, int n) {
		return m * n / gcdOf(m, n);
	}

	public static void main(String[] args) {
		System.out.println("GCD of (10, 4) = " + GcdLcm.gcdOf(10, 4));
		System.out.println("LCM of (10, 4) = " + GcdLcm.lcmOf(10, 4));
	}
}