Java程序使用递归计算给定数字的GCD
您可以使用递归程序计算给定两个数字的GCD，如以下程序所示。
示例
import java.util.Scanner;
public class GCDUsingRecursion {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("Enter first number :: ");
int firstNum = sc.nextInt();
System.out.println("Enter second number :: ");
int secondNum = sc.nextInt();
System.out.println("GCD of given two numbers is ::"+gcd(firstNum, secondNum));
}
public static int gcd(int num1, int num2) {
if (num2 != 0){
return gcd(num2, num1 % num2);
} else{
return num1;
}
}
}输出结果
Enter first number :: 625 Enter second number :: 125 GCD of given two numbers is ::125
热门推荐
10 祝孙辈生日祝福语简短
11 恋人跨年祝福语大全简短
12 考大学敬酒简短祝福语
13 开工投产大吉祝福语 简短
14 偶然结婚祝福语朋友简短
15 感谢学长学姐祝福语简短
16 戏精的祝福语简短
17 我要结婚祝福语简短
18 婚前女儿生日祝福语简短