28 lines
655 B
Python
28 lines
655 B
Python
|
# 数列
|
|||
|
|
# 1，3，5，7，9
|
|||
|
|
def fibonacci(n):
|
|||
|
|
if n <= 1: # 基本情况：第1项和第2项都是1
|
|||
|
|
return n
|
|||
|
|
else: # 递归情况：第n项是前两项的和
|
|||
|
|
return fibonacci(n - 1) + fibonacci(n - 2)
|
|||
|
|
|
|||
|
|
# n = 3
|
|||
|
|
# n = 2
|
|||
|
|
# n=1 结果1
|
|||
|
|
# n=0 结果0
|
|||
|
|
# 结果 1
|
|||
|
|
# n = 1 结果1
|
|||
|
|
# 结果 2
|
|||
|
|
print(fibonacci(6))
|
|||
|
|
# 阶乘 5的阶乘，5*4*3*2*1
|
|||
|
|
# 基本情况：n==1, 返回1
|
|||
|
|
# 递归过程：n*f(n-1)
|
|||
|
|
# 8的阶乘
|
|||
|
|
# ---------------------------------
|
|||
|
|
# n项的数列，1,2,3,4,5,6,7,8......
|
|||
|
|
# 使用递归求前n项数值的和
|
|||
|
|
# 基本情况：n==1
|
|||
|
|
# 递归过程：n+f(n-1)
|
|||
|
|
# 前10项的和
|
|||
|
|
|