斐波那契数列
摘要：
def fib(n): a = 0 b = 1 num = 0 while num < n: yield(b) a,b = b,a+ b num += 1 fib = fib(20) print(list(fib)) #[1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 1 阅读全文
posted @ 2020-07-19 12:41 Hello_Thanos 阅读(84) 评论(0) 推荐(0) 编辑
