斐波那契函数和回调函数

生成器版斐波那契

#_*_ encoding: utf-8 _*_   @author: ty  hery   2019/9/5
def fibonacci():
    a,b=0,1
    while True:
        yield b
        a,b = b, a+b
fib=fibonacci()

print(type(fibonacci),type(fib))
print (next(fib))
print (next(fib))
print (next(fib))
print ([next(fib) for i in range(10)])
输出:<class 'function'> <class 'generator'>
1
1
2
[3, 5, 8, 13, 21, 34, 55, 89, 144, 233]

回调函数形成斐波那契函数

def fibonacci(n):
    if n<=1:
        return 1
    return fibonacci(n-1) + fibonacci(n-2)
print (fibonacci(5)) # 输出8

爬楼梯回调函数

#_*_ encoding: utf-8 _*_   @author: ty  hery   2019/9/5
def climb(n,steps):
    count = 0
    if n ==0:
        count =1
    elif n >0:
        for step in steps:
            count += climb(n - step ,steps)
    return count
print(climb(10,(1,2,3)))