qq_43036676的博客

#计算 num 的阶乘def factorial(num): i, multiply = 1, 1 while i < num+1: multiply *= i i += 1 yield multiplyif __name__ == '__main__': # 生成器 user_input = input('请输入...

#计算两个数的最大公约数def Common_divisor(num1, num2):min = num1 if num1 < num2 else num2i, final_num = 1, 1while i <= min:if num1 % i == 0 and num2 % i == 0:final_num = ii += 1return final_numnum...

1.递归方式写法最简洁，但是效率最低，会出现大量的重复计算，时间复杂度O（1.618^n）,而且最深度1000def Fib_sequence(num): if num == 1 or num == 2: return 1 else: return Fib_sequence(num-2)+Fib_sequence(num-1)user_in...