可以使用以下方法来求两个数的最大公约数:
public class Main {
public static void main(String[] args) {
int num1 = 24;
int num2 = 36;
int gcd = findGCD(num1, num2);
System.out.println("The greatest common divisor of " + num1 + " and " + num2 + " is " + gcd);
}
public static int findGCD(int num1, int num2) {
while (num2 != 0) {
int temp = num2;
num2 = num1 % num2;
num1 = temp;
}
return num1;
}
}
运行以上代码,输出为:
The greatest common divisor of 24 and 36 is 12
辰迅云「云服务器」,即开即用、新一代英特尔至强铂金CPU、三副本存储NVMe SSD云盘,价格低至29元/月。点击查看>>
推荐阅读: java怎么实现des加密解密