求两个数的公约数java_java中怎样求两个数的最大公约数？

方法一：(辗转相除法)

设用户输入的两个整数为n1和n2且n1>n2，余数=n1%n2。当余数不为0时，把除数赋给n1做被除数，把余数赋给n2做除数再求得新余数，若还不为0再重复知道余数为0，此时n2就为最大公约数。

例：gcd(20,8)

20=2*8+4

8=2*4 因此gcd(20,8)=4

代码实现：

import javax.swing.JOptionPane;public class GreatestCommonDivisor{    public static void main(String[] args){

String num1String = JOptionPane.showInputDialog("Please enter the first integer:");        int num1 = Integer.parseInt(num1String);

String num2String = JOptionPane.showInputDialog("Please enter the second integer:");        int num2 = Integer.parseInt(num2String);        if(num1

num1=num2;

num2=temp;

}        int remainder = num1%num2;        int n1=num1,n2=num2;        while(remainder!=0){

num1=num2;

num2=remainder;

remainder=num1%num2;

}

JOptionPane.showMessageDialog(null,String.format("The greatest common divisor for %d and %d is %d.",n1,n2,num2));

}

}12345678910111213141516171819202122232425262728