[最小公倍数]
法一:遍历
def zuixiaogongbeishu(n1, n2):
n_xiao = min(n1, n2)
n_max = n1 * n2
for i in range(n_xiao, n_max + 1):
if i % n1 == 0 and i % n2 == 0:
return i
法二:乘倍数:
def searchshu(n1,n2):
n_xiao=min(n1,n2)
n_da=max(n1,n2)
for i in range(1,n_da+1):
if (i*n_xiao)% n_da ==0:
return i*n_xiao
时间比较: