斐波那契数列

原理

第三个数等于前面两个数之和
F(0) = 0, F(1) = 1, F(N) = F(N-1) + F(N-2)
如： 0, 1, 1, 2, 3, 5, 8, 13

代码

def fib(n):
    c, a, b = 0, 0, 1
	while c < n:
	# b=F(N)
	print(b, end=",")
	a, b = b, a + b
	c += 1

fib(10)

输出结果：1,1,2,3,5,8,13,21,34,55,