难度:
点击显示代码实现 1
1 2 3 4 5 6 7 8 9 10
def fb(n): a, b = 0, 1 for i in range(2, n+1): a, b = b, a+b return b for i in range(10): print(fb(i+1), end=' ') print()
点击显示代码实现 2
def fb(n): """斐波那契数递归函数""" if n <= 1: return n return fb(n-1) + fb(n-2) for i in range(10): print(fb(i+1), end=' ') print()
1
1 1 2 3 5 8 13 21 34 55
=== 全文完 ===