递归Recursion

递归

递归都可以用循环实现,反之不一定

# !< eg:
def count(n):
    for i in range(n):
        print(i)

def count_re(n):
    if n > 1:
        count_re(n-1)
    print(n-1)

count_re(10)

def fib(n):
    if n == 1:
        return 1
    if n == 2:
        return 1
    return fib(n - 1) + fib(n - 2)

print(fib(3))

def add(self, v):
    if self.next is not None:
        return self.next.add(v)
    self.v = Node(v)

递归Recursion

原文：https://www.cnblogs.com/xuzhaoping/p/11488574.html