递归

递归实现斐波那契数列

  1. def recursion(n: int) -> int:
  2.     if n < 2:
  3.         return 1
  4.     return recursion(n - 1) + recursion(n - 2)

23a79db7eb9672e4c623d25a54cdaf4.png