📄 7.12求最大公因子.txt
字号:
import java.util.Scanner;
public class UseRecursion {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.println("输入两数: ");
System.out.print("m = ");
int m = scanner.nextInt();
System.out.print("n = ");
int n = scanner.nextInt();
System.out.println("GCD: " + gcd(m,n));
}
private static int gcd(int m, int n){
if(n == 0)
return m;
else
return gcd(n, m % n);
}
}
执行结果:输入两数:
m = 10
n = 20
GCD: 10
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -