理论基础 递归实现 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; }