def gcd(x, y):
while y:
t = x % y
x = y
y = t
return x
print(gcd(4, 6))
def gcd(x, y):
if y:
return gcd(y, x%y)
else:
return x
print(gcd(4, 6))
第二种为递归法
def gcd(x, y):
while y:
t = x % y
x = y
y = t
return x
print(gcd(4, 6))
def gcd(x, y):
if y:
return gcd(y, x%y)
else:
return x
print(gcd(4, 6))
第二种为递归法
转载于:https://www.cnblogs.com/mr200/p/6612279.html