int gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
非递归实现
int gcd(int a, int b) {
int r = 0;
while (b != 0) {
r = a % b;
a = b;
b = r;
}
return a;
}
int gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
非递归实现
int gcd(int a, int b) {
int r = 0;
while (b != 0) {
r = a % b;
a = b;
b = r;
}
return a;
}
名师互学网 版权所有 (c)2021-2022 ICP备案号：晋ICP备2021003244-6号
