JAVA求2个整数的最大公约数

public static void main(String args[]) {
//Test
System.out.println(divisor(12, 5));
}

public static int divisor(int a, int b) {
if (a % b == 0) {
return b;
} else {
return divisor(b, a % b);
}
}

碾转相除法

public class CommonDivisor
{
public static void main(String[] args)
{
int n1 = 21;
int n2 = 14;
System.out.println("最大公约数是" + fun(n1, n2));
}

public static int fun(int n1, int n2)
{
int m = 1;
if (n1 < n2)
{
int t = n1;
n1 = n2;
n1 = t;
}

for (int i = n2; i > 1; i--)
{
if ((n1 % i == 0) && (n2 % i == 0))
{
return i;
}
}
return m;
}
}
// the end