热-辗转相除法求最大公约 使用java求解

package com.kwan.shuyu.web; public class GCD { public static int gcd(int m, int n) { while (n != 0) { int temp = m % n; m = n; n = temp; } return m; } public static void main(String[] args) { int m = 24; int n = 36; int result = gcd(m, n); System.out.println("最大公约数是：" + result); // 输出：最大公约数是：12 } }