# 递归实现算出第n次的结果 def fibonacci(n): if n <= 2: return 1 else: return fibonacci(n - 2) + fibonacci(n - 1) ret = fibonacci(4) print(ret)
# 递归实现算出第n次的结果 def fibonacci(n): if n <= 2: return 1 else: return fibonacci(n - 2) + fibonacci(n - 1) ret = fibonacci(4) print(ret)
转载于:https://www.cnblogs.com/whileke/p/11317974.html