# 循环实现阶乘
def factorial_iteration(n):
result = 1
for i in range(1, n + 1):
result *= i
return result
# d递归实现阶乘
def factorial_recursion(n):
if n == 1:
return 1
else:
return n * factorial_recursion(n - 1)
print(factorial_recursion(3))
print(factorial_iteration(3))
斐波那契:
# 循环实现斐波那契
def fibonacci_iteration(n):
n1 = 1
n2 = 1
n3 = 1
if n < 1: # 斐波那契数列必须从2开始
return -1
while (n - 2) > 0:
n3 = n2 + n1
n1 = n2
n2 = n3
n -= 1
return n3
print(list(map(fibonacci_iteration, range(1, 12))))
# 递归实现斐波那契
def fibonacci_recursion(n):
if n < 1:
return -1
if n == 1 or n == 2:
return 1
else:
return fibonacci_recursion(n - 1) + fibonacci_recursion(n - 2)
print(list(map(fibonacci_recursion,