源代碼：
#!usr/bin/python3
import sys
def fibonacci(n): #generator function
a, b, counter = 0, 1, 0
while True:
if (counter > n):
return
yield a
a, b = b, a + b
counter += 1
f = fibonacci(5) #f is iterator object
while True:
try:
print (next(f), end=" ")
except StopIteration:
sys.exit() #結(jié)果0 1 1 2 3 5
結(jié)果：
-----------------------------------------------------------------
#!/usr/bin/python3
# Fibonacci series: 斐波納契數(shù)列
# 兩個(gè)元素的總和確定了下一個(gè)數(shù)
a, b = 0, 1
while b < 10:
print(b)
a, b = b, a+b
1
1
2
3
5
8
-----------------------------------------------------------------
#!/usr/bin/python3
# Fibonacci series: 斐波納契數(shù)列
# 兩個(gè)元素的總和確定了下一個(gè)數(shù)
a, b = 0, 1
while b < 1000:
print(b, end=',')
a, b = b, a+b
#1,1,2,3,5,8,13,21,34,55,89,144,233,377,610,987,
--------------------------------------------------------------
斐波拉契數(shù)列
def fib(max): n, a, b = 0, 0, 1 while n < max: print(b) a, b = b, a + b n = n + 1 return 'done'fib(6)112358'done'
